H-Termination proof of /home/matraf/haskell/eval_FullyBlown

MAYBE 9.788 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could not be shown:

↳ HASKELL

  ↳ IFR

mainModule Main

((toRational :: Float -> Ratio Integer) :: Float -> Ratio Integer)

module Main where

import qualified Prelude

If Reductions:
The following If expression

if primGEqNatS x y then Succ (primDivNatS (primMinusNatS x y) (Succ y)) else Zero

is transformed to

primDivNatS0 x y True = Succ (primDivNatS (primMinusNatS x y) (Succ y))

primDivNatS0 x y False = Zero

The following If expression

if primGEqNatS x y then primModNatS (primMinusNatS x y) (Succ y) else Succ x

is transformed to

primModNatS0 x y True = primModNatS (primMinusNatS x y) (Succ y)

primModNatS0 x y False = Succ x

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

mainModule Main

((toRational :: Float -> Ratio Integer) :: Float -> Ratio Integer)

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

mainModule Main

((toRational :: Float -> Ratio Integer) :: Float -> Ratio Integer)

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

The following Function with conditions

gcd 0 0 = error []

gcd x y =

gcd' (abs x) (abs y)

where

gcd' x 0 = x

gcd' x y = gcd' y (x `rem` y)

is transformed to

gcd yz zu = gcd3 yz zu

gcd x y = gcd0 x y

gcd0 x y =

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

gcd1 True yz zu = error []

gcd1 zv zw zx = gcd0 zw zx

gcd2 True yz zu = gcd1 (zu == 0) yz zu

gcd2 zy zz vuu = gcd0 zz vuu

gcd3 yz zu = gcd2 (yz == 0) yz zu

gcd3 vuv vuw = gcd0 vuv vuw

The following Function with conditions

absReal x

| x >= 0

= x

| otherwise

= `negate` x

is transformed to

absReal x = absReal2 x

absReal1 x True = x

absReal1 x False = absReal0 x otherwise

absReal0 x True = `negate` x

absReal2 x = absReal1 x (x >= 0)

The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

reduce x y

| y == 0

= error []

| otherwise

= x `quot` d :% (y `quot` d)

where

d = gcd x y

is transformed to

reduce x y = reduce2 x y

reduce2 x y =

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

The following Function with conditions

signumReal x

| x == 0

= 0

| x > 0

= 1

| otherwise

= -1

is transformed to

signumReal x = signumReal3 x

signumReal2 x True = 0

signumReal2 x False = signumReal1 x (x > 0)

signumReal1 x True = 1

signumReal1 x False = signumReal0 x otherwise

signumReal0 x True = -1

signumReal3 x = signumReal2 x (x == 0)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

mainModule Main

((toRational :: Float -> Ratio Integer) :: Float -> Ratio Integer)

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

reduce1 x y (y == 0)

where

d = gcd x y

reduce0 x y True = x `quot` d :% (y `quot` d)

reduce1 x y True = error []

reduce1 x y False = reduce0 x y otherwise

are unpacked to the following functions on top level

reduce2Reduce1 vux vuy x y True = error []

reduce2Reduce1 vux vuy x y False = reduce2Reduce0 vux vuy x y otherwise

reduce2Reduce0 vux vuy x y True = x `quot` reduce2D vux vuy :% (y `quot` reduce2D vux vuy)

reduce2D vux vuy = gcd vux vuy

The bindings of the following Let/Where expression

gcd' (abs x) (abs y)

where

gcd' x xz = gcd'2 x xz

gcd' x y = gcd'0 x y

gcd'0 x y = gcd' y (x `rem` y)

gcd'1 True x xz = x

gcd'1 yu yv yw = gcd'0 yv yw

gcd'2 x xz = gcd'1 (xz == 0) x xz

gcd'2 yx yy = gcd'0 yx yy

are unpacked to the following functions on top level

gcd0Gcd'0 x y = gcd0Gcd' y (x `rem` y)

gcd0Gcd' x xz = gcd0Gcd'2 x xz

gcd0Gcd' x y = gcd0Gcd'0 x y

gcd0Gcd'2 x xz = gcd0Gcd'1 (xz == 0) x xz

gcd0Gcd'2 yx yy = gcd0Gcd'0 yx yy

gcd0Gcd'1 True x xz = x

gcd0Gcd'1 yu yv yw = gcd0Gcd'0 yv yw

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

mainModule Main

((toRational :: Float -> Ratio Integer) :: Float -> Ratio Integer)

module Main where

import qualified Prelude

Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                      ↳ Narrow

mainModule Main

(toRational :: Float -> Ratio Integer)

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="toRational",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="toRational vuz3",fontsize=16,color="black",shape="triangle"];3 -> 4[label="",style="solid", color="black", weight=3];
4[label="floatToRational vuz3",fontsize=16,color="burlywood",shape="box"];2806[label="vuz3/Float vuz30 vuz31",fontsize=10,color="white",style="solid",shape="box"];4 -> 2806[label="",style="solid", color="burlywood", weight=9];
2806 -> 5[label="",style="solid", color="burlywood", weight=3];
5[label="floatToRational (Float vuz30 vuz31)",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="Integer vuz30 % Integer vuz31",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="reduce (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="reduce2 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (abs (Integer vuz31)) (abs (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3];
10[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal (Integer vuz31)) (absReal (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3];
11[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (Integer vuz30 * signum (Integer vuz31)) (absReal2 (Integer vuz31)) (absReal2 (Integer vuz31) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero))) (absReal1 (Integer vuz31) (Integer vuz31 >= fromInt (Pos Zero)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT)) (absReal1 (Integer vuz31) (compare (Integer vuz31) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3];
14[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];14 -> 15[label="",style="solid", color="black", weight=3];
15[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT))) (absReal1 (Integer vuz31) (not (compare (Integer vuz31) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];15 -> 16[label="",style="solid", color="black", weight=3];
16[label="reduce2Reduce1 (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (Integer vuz30 * signum (Integer vuz31)) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT))) (absReal1 (Integer vuz31) (not (primCmpInt vuz31 (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];2807[label="vuz31/Pos vuz310",fontsize=10,color="white",style="solid",shape="box"];16 -> 2807[label="",style="solid", color="burlywood", weight=9];
2807 -> 17[label="",style="solid", color="burlywood", weight=3];
2808[label="vuz31/Neg vuz310",fontsize=10,color="white",style="solid",shape="box"];16 -> 2808[label="",style="solid", color="burlywood", weight=9];
2808 -> 18[label="",style="solid", color="burlywood", weight=3];
17[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos vuz310))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Pos vuz310)) (not (primCmpInt (Pos vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];2809[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];17 -> 2809[label="",style="solid", color="burlywood", weight=9];
2809 -> 19[label="",style="solid", color="burlywood", weight=3];
2810[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];17 -> 2810[label="",style="solid", color="burlywood", weight=9];
2810 -> 20[label="",style="solid", color="burlywood", weight=3];
18[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg vuz310))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT))) (absReal1 (Integer (Neg vuz310)) (not (primCmpInt (Neg vuz310) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="burlywood",shape="box"];2811[label="vuz310/Succ vuz3100",fontsize=10,color="white",style="solid",shape="box"];18 -> 2811[label="",style="solid", color="burlywood", weight=9];
2811 -> 21[label="",style="solid", color="burlywood", weight=3];
2812[label="vuz310/Zero",fontsize=10,color="white",style="solid",shape="box"];18 -> 2812[label="",style="solid", color="burlywood", weight=9];
2812 -> 22[label="",style="solid", color="burlywood", weight=3];
19[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];19 -> 23[label="",style="solid", color="black", weight=3];
20[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];20 -> 24[label="",style="solid", color="black", weight=3];
21[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];21 -> 25[label="",style="solid", color="black", weight=3];
22[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];22 -> 26[label="",style="solid", color="black", weight=3];
23[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];23 -> 27[label="",style="solid", color="black", weight=3];
24[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];24 -> 28[label="",style="solid", color="black", weight=3];
25[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT))) (absReal1 (Integer (Neg (Succ vuz3100))) (not (LT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];25 -> 29[label="",style="solid", color="black", weight=3];
26[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];26 -> 30[label="",style="solid", color="black", weight=3];
27[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];27 -> 31[label="",style="solid", color="black", weight=3];
28[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) (not False)) (absReal1 (Integer (Pos Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];28 -> 32[label="",style="solid", color="black", weight=3];
29[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) (not True)) (absReal1 (Integer (Neg (Succ vuz3100))) (not True) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];29 -> 33[label="",style="solid", color="black", weight=3];
30[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) (not False)) (absReal1 (Integer (Neg Zero)) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];30 -> 34[label="",style="solid", color="black", weight=3];
31[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False)) (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];31 -> 35[label="",style="solid", color="black", weight=3];
32[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (Integer vuz30 * signum (Integer (Pos Zero))) (absReal1 (Integer (Pos Zero)) True) (absReal1 (Integer (Pos Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];32 -> 36[label="",style="solid", color="black", weight=3];
33[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal1 (Integer (Neg (Succ vuz3100))) False) (absReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];33 -> 37[label="",style="solid", color="black", weight=3];
34[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (Integer vuz30 * signum (Integer (Neg Zero))) (absReal1 (Integer (Neg Zero)) True) (absReal1 (Integer (Neg Zero)) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];34 -> 38[label="",style="solid", color="black", weight=3];
35[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (absReal1 (Integer (Pos (Succ vuz3100))) True) (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];35 -> 39[label="",style="solid", color="black", weight=3];
36[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];36 -> 40[label="",style="solid", color="black", weight=3];
37[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise) (absReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];37 -> 41[label="",style="solid", color="black", weight=3];
38[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];38 -> 42[label="",style="solid", color="black", weight=3];
39[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];39 -> 43[label="",style="solid", color="black", weight=3];
40[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer (Pos Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];40 -> 44[label="",style="solid", color="black", weight=3];
41[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (absReal0 (Integer (Neg (Succ vuz3100))) True) (absReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];41 -> 45[label="",style="solid", color="black", weight=3];
42[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer (Neg Zero) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];42 -> 46[label="",style="solid", color="black", weight=3];
43[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];43 -> 47[label="",style="solid", color="black", weight=3];
44[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (primEqInt (Pos Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];44 -> 48[label="",style="solid", color="black", weight=3];
45[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (`negate` Integer (Neg (Succ vuz3100))) (`negate` Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];45 -> 49[label="",style="solid", color="black", weight=3];
46[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (primEqInt (Neg Zero) (Pos Zero))",fontsize=16,color="black",shape="box"];46 -> 50[label="",style="solid", color="black", weight=3];
47[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];47 -> 51[label="",style="solid", color="black", weight=3];
48[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) (Integer vuz30 * signum (Integer (Pos Zero))) (Integer (Pos Zero)) True",fontsize=16,color="black",shape="box"];48 -> 52[label="",style="solid", color="black", weight=3];
49[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == fromInt (Pos Zero))",fontsize=16,color="black",shape="box"];49 -> 53[label="",style="solid", color="black", weight=3];
50[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) (Integer vuz30 * signum (Integer (Neg Zero))) (Integer (Neg Zero)) True",fontsize=16,color="black",shape="box"];50 -> 54[label="",style="solid", color="black", weight=3];
51[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];51 -> 55[label="",style="solid", color="black", weight=3];
52[label="error []",fontsize=16,color="black",shape="triangle"];52 -> 56[label="",style="solid", color="black", weight=3];
53[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100))) == Integer (Pos Zero))",fontsize=16,color="black",shape="box"];53 -> 57[label="",style="solid", color="black", weight=3];
54 -> 52[label="",style="dashed", color="red", weight=0];
54[label="error []",fontsize=16,color="magenta"];55[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];55 -> 58[label="",style="solid", color="black", weight=3];
56[label="error []",fontsize=16,color="red",shape="box"];57[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (primNegInt (Neg (Succ vuz3100)))) (primEqInt (primNegInt (Neg (Succ vuz3100))) (Pos Zero))",fontsize=16,color="black",shape="box"];57 -> 59[label="",style="solid", color="black", weight=3];
58[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];58 -> 60[label="",style="solid", color="black", weight=3];
59[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))",fontsize=16,color="black",shape="box"];59 -> 61[label="",style="solid", color="black", weight=3];
60[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];60 -> 62[label="",style="dashed", color="green", weight=3];
60 -> 63[label="",style="dashed", color="green", weight=3];
61[label="reduce2Reduce1 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) False",fontsize=16,color="black",shape="box"];61 -> 64[label="",style="solid", color="black", weight=3];
62[label="Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];62 -> 65[label="",style="solid", color="black", weight=3];
63[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];63 -> 66[label="",style="solid", color="black", weight=3];
64[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) otherwise",fontsize=16,color="black",shape="box"];64 -> 67[label="",style="solid", color="black", weight=3];
65[label="Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];65 -> 68[label="",style="solid", color="black", weight=3];
66[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];66 -> 69[label="",style="solid", color="black", weight=3];
67[label="reduce2Reduce0 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) True",fontsize=16,color="black",shape="box"];67 -> 70[label="",style="solid", color="black", weight=3];
68[label="Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];68 -> 71[label="",style="solid", color="black", weight=3];
69[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];69 -> 72[label="",style="solid", color="black", weight=3];
70[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))) :% (Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100))))",fontsize=16,color="green",shape="box"];70 -> 73[label="",style="dashed", color="green", weight=3];
70 -> 74[label="",style="dashed", color="green", weight=3];
71[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];71 -> 75[label="",style="solid", color="black", weight=3];
72[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];72 -> 76[label="",style="solid", color="black", weight=3];
73[label="Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];73 -> 77[label="",style="solid", color="black", weight=3];
74[label="Integer (Pos (Succ vuz3100)) `quot` reduce2D (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];74 -> 78[label="",style="solid", color="black", weight=3];
75[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];75 -> 79[label="",style="solid", color="black", weight=3];
76[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];76 -> 80[label="",style="solid", color="black", weight=3];
77[label="Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];77 -> 81[label="",style="solid", color="black", weight=3];
78[label="Integer (Pos (Succ vuz3100)) `quot` gcd (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];78 -> 82[label="",style="solid", color="black", weight=3];
79[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];79 -> 83[label="",style="solid", color="black", weight=3];
80[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Pos (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];80 -> 84[label="",style="solid", color="black", weight=3];
81[label="Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) `quot` reduce2D (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];81 -> 85[label="",style="solid", color="black", weight=3];
82[label="Integer (Pos (Succ vuz3100)) `quot` gcd3 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];82 -> 86[label="",style="solid", color="black", weight=3];
83[label="Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];83 -> 87[label="",style="solid", color="black", weight=3];
84[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];84 -> 88[label="",style="solid", color="black", weight=3];
85[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];85 -> 89[label="",style="solid", color="black", weight=3];
86[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signum (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signum (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];86 -> 90[label="",style="solid", color="black", weight=3];
87[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];87 -> 91[label="",style="solid", color="black", weight=3];
88[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];88 -> 92[label="",style="solid", color="black", weight=3];
89[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];89 -> 93[label="",style="solid", color="black", weight=3];
90[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];90 -> 94[label="",style="solid", color="black", weight=3];
91[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];91 -> 95[label="",style="solid", color="black", weight=3];
92[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) (primEqInt (Pos (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];92 -> 96[label="",style="solid", color="black", weight=3];
93[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];93 -> 97[label="",style="solid", color="black", weight=3];
94[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100))) == fromInt (Pos Zero)) (Integer vuz30 * signumReal3 (Integer (Neg (Succ vuz3100)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];94 -> 98[label="",style="solid", color="black", weight=3];
95[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];95 -> 99[label="",style="solid", color="black", weight=3];
96[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Pos (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];96 -> 100[label="",style="solid", color="black", weight=3];
97[label="Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];97 -> 101[label="",style="solid", color="black", weight=3];
98[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];98 -> 102[label="",style="solid", color="black", weight=3];
99[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];99 -> 103[label="",style="solid", color="black", weight=3];
100[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];100 -> 104[label="",style="solid", color="black", weight=3];
101[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];101 -> 105[label="",style="solid", color="black", weight=3];
102[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) == Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];102 -> 106[label="",style="solid", color="black", weight=3];
103[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];103 -> 107[label="",style="solid", color="black", weight=3];
104[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];104 -> 108[label="",style="solid", color="black", weight=3];
105[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];105 -> 109[label="",style="solid", color="black", weight=3];
106[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) (primEqInt (Neg (Succ vuz3100)) (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];106 -> 110[label="",style="solid", color="black", weight=3];
107[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];107 -> 111[label="",style="solid", color="black", weight=3];
108[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];108 -> 112[label="",style="solid", color="black", weight=3];
109[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];109 -> 113[label="",style="solid", color="black", weight=3];
110[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal2 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];110 -> 114[label="",style="solid", color="black", weight=3];
111[label="Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];111 -> 115[label="",style="solid", color="black", weight=3];
112[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];112 -> 116[label="",style="solid", color="black", weight=3];
113[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];113 -> 117[label="",style="solid", color="black", weight=3];
114[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero)) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (Integer (Neg (Succ vuz3100)) > fromInt (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];114 -> 118[label="",style="solid", color="black", weight=3];
115[label="Integer vuz30 * fromInt (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];115 -> 119[label="",style="solid", color="black", weight=3];
116[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (primCmpNat (Succ vuz3100) Zero == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];116 -> 120[label="",style="solid", color="black", weight=3];
117[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];117 -> 121[label="",style="solid", color="black", weight=3];
118[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (fromInt (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];118 -> 122[label="",style="solid", color="black", weight=3];
119[label="Integer vuz30 * Integer (Pos (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];119 -> 123[label="",style="solid", color="black", weight=3];
120[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) (GT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];120 -> 124[label="",style="solid", color="black", weight=3];
121[label="Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False `quot` reduce2D (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];121 -> 125[label="",style="solid", color="black", weight=3];
122[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (compare (Integer (Neg (Succ vuz3100))) (Integer (Pos Zero)) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];122 -> 126[label="",style="solid", color="black", weight=3];
123[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];123 -> 127[label="",style="solid", color="black", weight=3];
124[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Pos (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];124 -> 128[label="",style="solid", color="black", weight=3];
125[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];125 -> 129[label="",style="solid", color="black", weight=3];
126[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (primCmpInt (Neg (Succ vuz3100)) (Pos Zero) == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];126 -> 130[label="",style="solid", color="black", weight=3];
127[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];127 -> 131[label="",style="solid", color="black", weight=3];
128[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];128 -> 132[label="",style="solid", color="black", weight=3];
129[label="Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True `quot` reduce2D (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];129 -> 133[label="",style="solid", color="black", weight=3];
130[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT) == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) (LT == GT)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];130 -> 134[label="",style="solid", color="black", weight=3];
131[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];131 -> 135[label="",style="solid", color="black", weight=3];
132[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];132 -> 136[label="",style="solid", color="black", weight=3];
133[label="Integer vuz30 * fromInt (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];133 -> 137[label="",style="solid", color="black", weight=3];
134[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False == fromInt (Pos Zero)) (Integer vuz30 * signumReal1 (Integer (Neg (Succ vuz3100))) False) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];134 -> 138[label="",style="solid", color="black", weight=3];
135[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];135 -> 139[label="",style="solid", color="black", weight=3];
136[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];136 -> 140[label="",style="solid", color="black", weight=3];
137[label="Integer vuz30 * Integer (Neg (Succ Zero)) `quot` reduce2D (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];137 -> 141[label="",style="solid", color="black", weight=3];
138[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) otherwise) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];138 -> 142[label="",style="solid", color="black", weight=3];
139[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];139 -> 143[label="",style="solid", color="black", weight=3];
140[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];140 -> 144[label="",style="solid", color="black", weight=3];
141[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` reduce2D (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];141 -> 145[label="",style="solid", color="black", weight=3];
142[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True == fromInt (Pos Zero)) (Integer vuz30 * signumReal0 (Integer (Neg (Succ vuz3100))) True) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];142 -> 146[label="",style="solid", color="black", weight=3];
143[label="Integer (primMulInt vuz30 (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2814[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];143 -> 2814[label="",style="solid", color="burlywood", weight=9];
2814 -> 147[label="",style="solid", color="burlywood", weight=3];
2815[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];143 -> 2815[label="",style="solid", color="burlywood", weight=9];
2815 -> 148[label="",style="solid", color="burlywood", weight=3];
144[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2816[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];144 -> 2816[label="",style="solid", color="burlywood", weight=9];
2816 -> 149[label="",style="solid", color="burlywood", weight=3];
2817[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];144 -> 2817[label="",style="solid", color="burlywood", weight=9];
2817 -> 150[label="",style="solid", color="burlywood", weight=3];
145[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];145 -> 151[label="",style="solid", color="black", weight=3];
146[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * fromInt (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * fromInt (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];146 -> 152[label="",style="solid", color="black", weight=3];
147[label="Integer (primMulInt (Pos vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];147 -> 153[label="",style="solid", color="black", weight=3];
148[label="Integer (primMulInt (Neg vuz300) (Pos (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];148 -> 154[label="",style="solid", color="black", weight=3];
149[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];149 -> 155[label="",style="solid", color="black", weight=3];
150[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Pos (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Pos (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];150 -> 156[label="",style="solid", color="black", weight=3];
151[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd3 (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];151 -> 157[label="",style="solid", color="black", weight=3];
152[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer vuz30 * Integer (Neg (Succ Zero)) == fromInt (Pos Zero)) (Integer vuz30 * Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];152 -> 158[label="",style="solid", color="black", weight=3];
153[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];2818[label="vuz300/Succ vuz3000",fontsize=10,color="white",style="solid",shape="box"];153 -> 2818[label="",style="solid", color="burlywood", weight=9];
2818 -> 159[label="",style="solid", color="burlywood", weight=3];
2819[label="vuz300/Zero",fontsize=10,color="white",style="solid",shape="box"];153 -> 2819[label="",style="solid", color="burlywood", weight=9];
2819 -> 160[label="",style="solid", color="burlywood", weight=3];
154[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];2820[label="vuz300/Succ vuz3000",fontsize=10,color="white",style="solid",shape="box"];154 -> 2820[label="",style="solid", color="burlywood", weight=9];
2820 -> 161[label="",style="solid", color="burlywood", weight=3];
2821[label="vuz300/Zero",fontsize=10,color="white",style="solid",shape="box"];154 -> 2821[label="",style="solid", color="burlywood", weight=9];
2821 -> 162[label="",style="solid", color="burlywood", weight=3];
155 -> 490[label="",style="dashed", color="red", weight=0];
155[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];155 -> 491[label="",style="dashed", color="magenta", weight=3];
155 -> 492[label="",style="dashed", color="magenta", weight=3];
156 -> 548[label="",style="dashed", color="red", weight=0];
156[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];156 -> 549[label="",style="dashed", color="magenta", weight=3];
156 -> 550[label="",style="dashed", color="magenta", weight=3];
157[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];157 -> 167[label="",style="solid", color="black", weight=3];
158[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == fromInt (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];158 -> 168[label="",style="solid", color="black", weight=3];
159[label="Integer (Pos (primMulNat (Succ vuz3000) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat (Succ vuz3000) (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat (Succ vuz3000) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];159 -> 169[label="",style="solid", color="black", weight=3];
160[label="Integer (Pos (primMulNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];160 -> 170[label="",style="solid", color="black", weight=3];
161[label="Integer (Neg (primMulNat (Succ vuz3000) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat (Succ vuz3000) (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat (Succ vuz3000) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];161 -> 171[label="",style="solid", color="black", weight=3];
162[label="Integer (Neg (primMulNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat Zero (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];162 -> 172[label="",style="solid", color="black", weight=3];
491 -> 399[label="",style="dashed", color="red", weight=0];
491[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];491 -> 536[label="",style="dashed", color="magenta", weight=3];
492 -> 399[label="",style="dashed", color="red", weight=0];
492[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];492 -> 537[label="",style="dashed", color="magenta", weight=3];
490[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos vuz17) (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];2826[label="vuz17/Succ vuz170",fontsize=10,color="white",style="solid",shape="box"];490 -> 2826[label="",style="solid", color="burlywood", weight=9];
2826 -> 538[label="",style="solid", color="burlywood", weight=3];
2827[label="vuz17/Zero",fontsize=10,color="white",style="solid",shape="box"];490 -> 2827[label="",style="solid", color="burlywood", weight=9];
2827 -> 539[label="",style="solid", color="burlywood", weight=3];
549 -> 399[label="",style="dashed", color="red", weight=0];
549[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];549 -> 594[label="",style="dashed", color="magenta", weight=3];
550 -> 399[label="",style="dashed", color="red", weight=0];
550[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];550 -> 595[label="",style="dashed", color="magenta", weight=3];
548[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg vuz31) (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="triangle"];2830[label="vuz31/Succ vuz310",fontsize=10,color="white",style="solid",shape="box"];548 -> 2830[label="",style="solid", color="burlywood", weight=9];
2830 -> 596[label="",style="solid", color="burlywood", weight=3];
2831[label="vuz31/Zero",fontsize=10,color="white",style="solid",shape="box"];548 -> 2831[label="",style="solid", color="burlywood", weight=9];
2831 -> 597[label="",style="solid", color="burlywood", weight=3];
167[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];167 -> 177[label="",style="solid", color="black", weight=3];
168[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (Integer (primMulInt vuz30 (Neg (Succ Zero))) == Integer (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];168 -> 178[label="",style="solid", color="black", weight=3];
169 -> 398[label="",style="dashed", color="red", weight=0];
169[label="Integer (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];169 -> 399[label="",style="dashed", color="magenta", weight=3];
169 -> 400[label="",style="dashed", color="magenta", weight=3];
170[label="Integer (Pos Zero) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];170 -> 181[label="",style="solid", color="black", weight=3];
171 -> 444[label="",style="dashed", color="red", weight=0];
171[label="Integer (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat (primMulNat vuz3000 (Succ Zero)) (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];171 -> 445[label="",style="dashed", color="magenta", weight=3];
171 -> 446[label="",style="dashed", color="magenta", weight=3];
172[label="Integer (Neg Zero) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];172 -> 184[label="",style="solid", color="black", weight=3];
536[label="vuz300",fontsize=16,color="green",shape="box"];399[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];2834[label="vuz3000/Succ vuz30000",fontsize=10,color="white",style="solid",shape="box"];399 -> 2834[label="",style="solid", color="burlywood", weight=9];
2834 -> 431[label="",style="solid", color="burlywood", weight=3];
2835[label="vuz3000/Zero",fontsize=10,color="white",style="solid",shape="box"];399 -> 2835[label="",style="solid", color="burlywood", weight=9];
2835 -> 432[label="",style="solid", color="burlywood", weight=3];
537[label="vuz300",fontsize=16,color="green",shape="box"];538[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (Succ vuz170)) (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];538 -> 598[label="",style="solid", color="black", weight=3];
539[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];539 -> 599[label="",style="solid", color="black", weight=3];
594[label="vuz300",fontsize=16,color="green",shape="box"];595[label="vuz300",fontsize=16,color="green",shape="box"];596[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (Succ vuz310)) (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];596 -> 609[label="",style="solid", color="black", weight=3];
597[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];597 -> 610[label="",style="solid", color="black", weight=3];
177[label="Integer (primMulInt vuz30 (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2836[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];177 -> 2836[label="",style="solid", color="burlywood", weight=9];
2836 -> 191[label="",style="solid", color="burlywood", weight=3];
2837[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];177 -> 2837[label="",style="solid", color="burlywood", weight=9];
2837 -> 192[label="",style="solid", color="burlywood", weight=3];
178[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt vuz30 (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt vuz30 (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2838[label="vuz30/Pos vuz300",fontsize=10,color="white",style="solid",shape="box"];178 -> 2838[label="",style="solid", color="burlywood", weight=9];
2838 -> 193[label="",style="solid", color="burlywood", weight=3];
2839[label="vuz30/Neg vuz300",fontsize=10,color="white",style="solid",shape="box"];178 -> 2839[label="",style="solid", color="burlywood", weight=9];
2839 -> 194[label="",style="solid", color="burlywood", weight=3];
400[label="vuz3100",fontsize=16,color="green",shape="box"];398[label="Integer (Pos (primPlusNat vuz7 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat vuz7 (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat vuz7 (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="burlywood",shape="triangle"];2840[label="vuz7/Succ vuz70",fontsize=10,color="white",style="solid",shape="box"];398 -> 2840[label="",style="solid", color="burlywood", weight=9];
2840 -> 433[label="",style="solid", color="burlywood", weight=3];
2841[label="vuz7/Zero",fontsize=10,color="white",style="solid",shape="box"];398 -> 2841[label="",style="solid", color="burlywood", weight=9];
2841 -> 434[label="",style="solid", color="burlywood", weight=3];
181[label="Integer (Pos Zero) `quot` gcd2 True (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];181 -> 197[label="",style="solid", color="black", weight=3];
445[label="vuz3100",fontsize=16,color="green",shape="box"];446 -> 399[label="",style="dashed", color="red", weight=0];
446[label="primMulNat vuz3000 (Succ Zero)",fontsize=16,color="magenta"];446 -> 477[label="",style="dashed", color="magenta", weight=3];
444[label="Integer (Neg (primPlusNat vuz13 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat vuz13 (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat vuz13 (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="burlywood",shape="triangle"];2843[label="vuz13/Succ vuz130",fontsize=10,color="white",style="solid",shape="box"];444 -> 2843[label="",style="solid", color="burlywood", weight=9];
2843 -> 478[label="",style="solid", color="burlywood", weight=3];
2844[label="vuz13/Zero",fontsize=10,color="white",style="solid",shape="box"];444 -> 2844[label="",style="solid", color="burlywood", weight=9];
2844 -> 479[label="",style="solid", color="burlywood", weight=3];
184[label="Integer (Neg Zero) `quot` gcd2 True (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];184 -> 200[label="",style="solid", color="black", weight=3];
431[label="primMulNat (Succ vuz30000) (Succ Zero)",fontsize=16,color="black",shape="box"];431 -> 440[label="",style="solid", color="black", weight=3];
432[label="primMulNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];432 -> 441[label="",style="solid", color="black", weight=3];
598[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];598 -> 611[label="",style="solid", color="black", weight=3];
599[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];599 -> 612[label="",style="solid", color="black", weight=3];
609[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 False (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];609 -> 621[label="",style="solid", color="black", weight=3];
610[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 True (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];610 -> 622[label="",style="solid", color="black", weight=3];
191[label="Integer (primMulInt (Pos vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];191 -> 207[label="",style="solid", color="black", weight=3];
192[label="Integer (primMulInt (Neg vuz300) (Neg (Succ Zero))) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];192 -> 208[label="",style="solid", color="black", weight=3];
193[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Pos vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Pos vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];193 -> 209[label="",style="solid", color="black", weight=3];
194[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (primMulInt (Neg vuz300) (Neg (Succ Zero))) (Pos Zero)) (Integer (primMulInt (Neg vuz300) (Neg (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];194 -> 210[label="",style="solid", color="black", weight=3];
433[label="Integer (Pos (primPlusNat (Succ vuz70) (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat (Succ vuz70) (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat (Succ vuz70) (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];433 -> 442[label="",style="solid", color="black", weight=3];
434[label="Integer (Pos (primPlusNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primPlusNat Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (primPlusNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];434 -> 443[label="",style="solid", color="black", weight=3];
197[label="Integer (Pos Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];197 -> 214[label="",style="solid", color="black", weight=3];
477[label="vuz3000",fontsize=16,color="green",shape="box"];478[label="Integer (Neg (primPlusNat (Succ vuz130) (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat (Succ vuz130) (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat (Succ vuz130) (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];478 -> 482[label="",style="solid", color="black", weight=3];
479[label="Integer (Neg (primPlusNat Zero (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primPlusNat Zero (Succ Zero))) (Pos Zero)) (Integer (Neg (primPlusNat Zero (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];479 -> 483[label="",style="solid", color="black", weight=3];
200[label="Integer (Neg Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];200 -> 218[label="",style="solid", color="black", weight=3];
440 -> 480[label="",style="dashed", color="red", weight=0];
440[label="primPlusNat (primMulNat vuz30000 (Succ Zero)) (Succ Zero)",fontsize=16,color="magenta"];440 -> 481[label="",style="dashed", color="magenta", weight=3];
441[label="Zero",fontsize=16,color="green",shape="box"];611[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];611 -> 623[label="",style="solid", color="black", weight=3];
612[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];612 -> 624[label="",style="solid", color="black", weight=3];
621[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];621 -> 628[label="",style="solid", color="black", weight=3];
622[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];622 -> 629[label="",style="solid", color="black", weight=3];
207 -> 154[label="",style="dashed", color="red", weight=0];
207[label="Integer (Neg (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];207 -> 227[label="",style="dashed", color="magenta", weight=3];
207 -> 228[label="",style="dashed", color="magenta", weight=3];
208 -> 153[label="",style="dashed", color="red", weight=0];
208[label="Integer (Pos (primMulNat vuz300 (Succ Zero))) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];208 -> 229[label="",style="dashed", color="magenta", weight=3];
208 -> 230[label="",style="dashed", color="magenta", weight=3];
209 -> 548[label="",style="dashed", color="red", weight=0];
209[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Neg (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Neg (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];209 -> 559[label="",style="dashed", color="magenta", weight=3];
209 -> 560[label="",style="dashed", color="magenta", weight=3];
209 -> 561[label="",style="dashed", color="magenta", weight=3];
210 -> 490[label="",style="dashed", color="red", weight=0];
210[label="Integer (Pos (Succ vuz3100)) `quot` gcd2 (primEqInt (Pos (primMulNat vuz300 (Succ Zero))) (Pos Zero)) (Integer (Pos (primMulNat vuz300 (Succ Zero)))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];210 -> 501[label="",style="dashed", color="magenta", weight=3];
210 -> 502[label="",style="dashed", color="magenta", weight=3];
210 -> 503[label="",style="dashed", color="magenta", weight=3];
442[label="Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) `quot` gcd2 (primEqInt (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];442 -> 484[label="",style="solid", color="black", weight=3];
443[label="Integer (Pos (Succ Zero)) `quot` gcd2 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];443 -> 485[label="",style="solid", color="black", weight=3];
214[label="Integer (Pos Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];214 -> 238[label="",style="solid", color="black", weight=3];
482[label="Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero)))) `quot` gcd2 (primEqInt (Neg (Succ (Succ (primPlusNat vuz130 Zero)))) (Pos Zero)) (Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];482 -> 540[label="",style="solid", color="black", weight=3];
483[label="Integer (Neg (Succ Zero)) `quot` gcd2 (primEqInt (Neg (Succ Zero)) (Pos Zero)) (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];483 -> 541[label="",style="solid", color="black", weight=3];
218[label="Integer (Neg Zero) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];218 -> 242[label="",style="solid", color="black", weight=3];
481 -> 399[label="",style="dashed", color="red", weight=0];
481[label="primMulNat vuz30000 (Succ Zero)",fontsize=16,color="magenta"];481 -> 486[label="",style="dashed", color="magenta", weight=3];
480[label="primPlusNat vuz15 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];2851[label="vuz15/Succ vuz150",fontsize=10,color="white",style="solid",shape="box"];480 -> 2851[label="",style="solid", color="burlywood", weight=9];
2851 -> 487[label="",style="solid", color="burlywood", weight=3];
2852[label="vuz15/Zero",fontsize=10,color="white",style="solid",shape="box"];480 -> 2852[label="",style="solid", color="burlywood", weight=9];
2852 -> 488[label="",style="solid", color="burlywood", weight=3];
623[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Pos vuz16))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];623 -> 630[label="",style="solid", color="black", weight=3];
624[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];624 -> 631[label="",style="solid", color="black", weight=3];
628[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (abs (Integer (Neg vuz30))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];628 -> 636[label="",style="solid", color="black", weight=3];
629[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];629 -> 637[label="",style="solid", color="black", weight=3];
227[label="vuz300",fontsize=16,color="green",shape="box"];228[label="vuz3100",fontsize=16,color="green",shape="box"];229[label="vuz300",fontsize=16,color="green",shape="box"];230[label="vuz3100",fontsize=16,color="green",shape="box"];559 -> 399[label="",style="dashed", color="red", weight=0];
559[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];559 -> 600[label="",style="dashed", color="magenta", weight=3];
560 -> 399[label="",style="dashed", color="red", weight=0];
560[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];560 -> 601[label="",style="dashed", color="magenta", weight=3];
561[label="vuz3100",fontsize=16,color="green",shape="box"];501 -> 399[label="",style="dashed", color="red", weight=0];
501[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];501 -> 542[label="",style="dashed", color="magenta", weight=3];
502 -> 399[label="",style="dashed", color="red", weight=0];
502[label="primMulNat vuz300 (Succ Zero)",fontsize=16,color="magenta"];502 -> 543[label="",style="dashed", color="magenta", weight=3];
503[label="vuz3100",fontsize=16,color="green",shape="box"];484[label="Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) `quot` gcd2 False (Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];484 -> 544[label="",style="solid", color="black", weight=3];
485[label="Integer (Pos (Succ Zero)) `quot` gcd2 False (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];485 -> 545[label="",style="solid", color="black", weight=3];
238[label="Integer (Pos Zero) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];238 -> 255[label="",style="solid", color="black", weight=3];
540[label="Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero)))) `quot` gcd2 False (Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];540 -> 602[label="",style="solid", color="black", weight=3];
541[label="Integer (Neg (Succ Zero)) `quot` gcd2 False (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];541 -> 603[label="",style="solid", color="black", weight=3];
242[label="Integer (Neg Zero) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];242 -> 260[label="",style="solid", color="black", weight=3];
486[label="vuz30000",fontsize=16,color="green",shape="box"];487[label="primPlusNat (Succ vuz150) (Succ Zero)",fontsize=16,color="black",shape="box"];487 -> 546[label="",style="solid", color="black", weight=3];
488[label="primPlusNat Zero (Succ Zero)",fontsize=16,color="black",shape="box"];488 -> 547[label="",style="solid", color="black", weight=3];
630[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Pos vuz16))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];630 -> 638[label="",style="solid", color="black", weight=3];
631[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];631 -> 639[label="",style="solid", color="black", weight=3];
636[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (abs (Integer (Neg vuz30))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];636 -> 652[label="",style="solid", color="black", weight=3];
637[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];637 -> 653[label="",style="solid", color="black", weight=3];
600[label="vuz300",fontsize=16,color="green",shape="box"];601[label="vuz300",fontsize=16,color="green",shape="box"];542[label="vuz300",fontsize=16,color="green",shape="box"];543[label="vuz300",fontsize=16,color="green",shape="box"];544[label="Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) `quot` gcd0 (Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];544 -> 604[label="",style="solid", color="black", weight=3];
545[label="Integer (Pos (Succ Zero)) `quot` gcd0 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];545 -> 605[label="",style="solid", color="black", weight=3];
255[label="Integer (Pos Zero) `quot` gcd1 False (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];255 -> 275[label="",style="solid", color="black", weight=3];
602[label="Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero)))) `quot` gcd0 (Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];602 -> 613[label="",style="solid", color="black", weight=3];
603[label="Integer (Neg (Succ Zero)) `quot` gcd0 (Integer (Neg (Succ Zero))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];603 -> 614[label="",style="solid", color="black", weight=3];
260[label="Integer (Neg Zero) `quot` gcd1 False (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];260 -> 280[label="",style="solid", color="black", weight=3];
546[label="Succ (Succ (primPlusNat vuz150 Zero))",fontsize=16,color="green",shape="box"];546 -> 606[label="",style="dashed", color="green", weight=3];
547[label="Succ Zero",fontsize=16,color="green",shape="box"];638[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];638 -> 654[label="",style="solid", color="black", weight=3];
639[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];639 -> 655[label="",style="solid", color="black", weight=3];
652[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];652 -> 662[label="",style="solid", color="black", weight=3];
653[label="Integer (Pos (Succ vuz3100)) `quot` gcd1 False (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];653 -> 663[label="",style="solid", color="black", weight=3];
604[label="Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) `quot` gcd0Gcd' (abs (Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];604 -> 615[label="",style="solid", color="black", weight=3];
605[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd' (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];605 -> 616[label="",style="solid", color="black", weight=3];
275[label="Integer (Pos Zero) `quot` gcd0 (Integer (Pos Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];275 -> 296[label="",style="solid", color="black", weight=3];
613 -> 625[label="",style="dashed", color="red", weight=0];
613[label="Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero)))) `quot` gcd0Gcd' (abs (Integer (Neg (Succ (Succ (primPlusNat vuz130 Zero)))))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="magenta"];613 -> 626[label="",style="dashed", color="magenta", weight=3];
613 -> 627[label="",style="dashed", color="magenta", weight=3];
614[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd' (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];614 -> 632[label="",style="solid", color="black", weight=3];
280[label="Integer (Neg Zero) `quot` gcd0 (Integer (Neg Zero)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];280 -> 302[label="",style="solid", color="black", weight=3];
606[label="primPlusNat vuz150 Zero",fontsize=16,color="burlywood",shape="triangle"];2858[label="vuz150/Succ vuz1500",fontsize=10,color="white",style="solid",shape="box"];606 -> 2858[label="",style="solid", color="burlywood", weight=9];
2858 -> 617[label="",style="solid", color="burlywood", weight=3];
2859[label="vuz150/Zero",fontsize=10,color="white",style="solid",shape="box"];606 -> 2859[label="",style="solid", color="burlywood", weight=9];
2859 -> 618[label="",style="solid", color="burlywood", weight=3];
654[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];654 -> 664[label="",style="solid", color="black", weight=3];
655 -> 611[label="",style="dashed", color="red", weight=0];
655[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Pos vuz16)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];662[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];662 -> 671[label="",style="solid", color="black", weight=3];
663 -> 621[label="",style="dashed", color="red", weight=0];
663[label="Integer (Pos (Succ vuz3100)) `quot` gcd0 (Integer (Neg vuz30)) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];615 -> 633[label="",style="dashed", color="red", weight=0];
615[label="Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ (Succ (primPlusNat vuz70 Zero)))))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="magenta"];615 -> 634[label="",style="dashed", color="magenta", weight=3];
615 -> 635[label="",style="dashed", color="magenta", weight=3];
616[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];616 -> 640[label="",style="solid", color="black", weight=3];
296[label="Integer (Pos Zero) `quot` gcd0Gcd' (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];296 -> 320[label="",style="solid", color="black", weight=3];
626 -> 606[label="",style="dashed", color="red", weight=0];
626[label="primPlusNat vuz130 Zero",fontsize=16,color="magenta"];626 -> 641[label="",style="dashed", color="magenta", weight=3];
627 -> 606[label="",style="dashed", color="red", weight=0];
627[label="primPlusNat vuz130 Zero",fontsize=16,color="magenta"];627 -> 642[label="",style="dashed", color="magenta", weight=3];
625[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd' (abs (Integer (Neg (Succ (Succ vuz45))))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="triangle"];625 -> 643[label="",style="solid", color="black", weight=3];
632[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'2 (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];632 -> 644[label="",style="solid", color="black", weight=3];
302[label="Integer (Neg Zero) `quot` gcd0Gcd' (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];302 -> 326[label="",style="solid", color="black", weight=3];
617[label="primPlusNat (Succ vuz1500) Zero",fontsize=16,color="black",shape="box"];617 -> 645[label="",style="solid", color="black", weight=3];
618[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];618 -> 646[label="",style="solid", color="black", weight=3];
664[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];664 -> 672[label="",style="solid", color="black", weight=3];
671[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];671 -> 679[label="",style="solid", color="black", weight=3];
634 -> 606[label="",style="dashed", color="red", weight=0];
634[label="primPlusNat vuz70 Zero",fontsize=16,color="magenta"];634 -> 647[label="",style="dashed", color="magenta", weight=3];
635 -> 606[label="",style="dashed", color="red", weight=0];
635[label="primPlusNat vuz70 Zero",fontsize=16,color="magenta"];635 -> 648[label="",style="dashed", color="magenta", weight=3];
633[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'2 (abs (Integer (Pos (Succ (Succ vuz47))))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="triangle"];633 -> 649[label="",style="solid", color="black", weight=3];
640[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];640 -> 656[label="",style="solid", color="black", weight=3];
320[label="Integer (Pos Zero) `quot` gcd0Gcd'2 (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];320 -> 345[label="",style="solid", color="black", weight=3];
641[label="vuz130",fontsize=16,color="green",shape="box"];642[label="vuz130",fontsize=16,color="green",shape="box"];643[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'2 (abs (Integer (Neg (Succ (Succ vuz45))))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];643 -> 657[label="",style="solid", color="black", weight=3];
644[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];644 -> 658[label="",style="solid", color="black", weight=3];
326[label="Integer (Neg Zero) `quot` gcd0Gcd'2 (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];326 -> 352[label="",style="solid", color="black", weight=3];
645[label="Succ vuz1500",fontsize=16,color="green",shape="box"];646[label="Zero",fontsize=16,color="green",shape="box"];672[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];672 -> 680[label="",style="solid", color="black", weight=3];
679[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];679 -> 687[label="",style="solid", color="black", weight=3];
647[label="vuz70",fontsize=16,color="green",shape="box"];648[label="vuz70",fontsize=16,color="green",shape="box"];649[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (abs (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];649 -> 659[label="",style="solid", color="black", weight=3];
656[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];656 -> 665[label="",style="solid", color="black", weight=3];
345[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];345 -> 373[label="",style="solid", color="black", weight=3];
657[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (abs (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];657 -> 666[label="",style="solid", color="black", weight=3];
658[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];658 -> 667[label="",style="solid", color="black", weight=3];
352[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (abs (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];352 -> 380[label="",style="solid", color="black", weight=3];
680[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];680 -> 688[label="",style="solid", color="black", weight=3];
687[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];687 -> 695[label="",style="solid", color="black", weight=3];
659[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];659 -> 668[label="",style="solid", color="black", weight=3];
665[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal2 (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];665 -> 673[label="",style="solid", color="black", weight=3];
373[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];373 -> 435[label="",style="solid", color="black", weight=3];
666[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];666 -> 674[label="",style="solid", color="black", weight=3];
667[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal2 (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];667 -> 675[label="",style="solid", color="black", weight=3];
380[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];380 -> 489[label="",style="solid", color="black", weight=3];
688[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];688 -> 696[label="",style="solid", color="black", weight=3];
695[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];695 -> 703[label="",style="solid", color="black", weight=3];
668[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz8))) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal2 (Integer (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];668 -> 676[label="",style="solid", color="black", weight=3];
673[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (Integer (Pos (Succ vuz8)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (Integer (Pos (Succ vuz8)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];673 -> 681[label="",style="solid", color="black", weight=3];
435[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];435 -> 607[label="",style="solid", color="black", weight=3];
674[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz14))) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal2 (Integer (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];674 -> 682[label="",style="solid", color="black", weight=3];
675[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (Integer (Pos (Succ vuz14)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (Integer (Pos (Succ vuz14)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];675 -> 683[label="",style="solid", color="black", weight=3];
489[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal2 (Integer (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];489 -> 608[label="",style="solid", color="black", weight=3];
696[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];696 -> 704[label="",style="solid", color="black", weight=3];
703[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];703 -> 711[label="",style="solid", color="black", weight=3];
676[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (Integer (Pos (Succ vuz8)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (Integer (Pos (Succ vuz8)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];676 -> 684[label="",style="solid", color="black", weight=3];
681[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];681 -> 689[label="",style="solid", color="black", weight=3];
607[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];607 -> 619[label="",style="solid", color="black", weight=3];
682[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (Integer (Pos (Succ vuz14)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (Integer (Pos (Succ vuz14)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];682 -> 690[label="",style="solid", color="black", weight=3];
683[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];683 -> 691[label="",style="solid", color="black", weight=3];
608[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz3100)) >= fromInt (Pos Zero)))",fontsize=16,color="black",shape="box"];608 -> 620[label="",style="solid", color="black", weight=3];
704[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];704 -> 712[label="",style="solid", color="black", weight=3];
711[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];711 -> 719[label="",style="solid", color="black", weight=3];
684[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];684 -> 692[label="",style="solid", color="black", weight=3];
689[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];689 -> 697[label="",style="solid", color="black", weight=3];
619[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];619 -> 650[label="",style="solid", color="black", weight=3];
690[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];690 -> 698[label="",style="solid", color="black", weight=3];
691[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];691 -> 699[label="",style="solid", color="black", weight=3];
620[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) /= LT))",fontsize=16,color="black",shape="box"];620 -> 651[label="",style="solid", color="black", weight=3];
712[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];712 -> 720[label="",style="solid", color="black", weight=3];
719[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];719 -> 727[label="",style="solid", color="black", weight=3];
692[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];692 -> 700[label="",style="solid", color="black", weight=3];
697[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];697 -> 705[label="",style="solid", color="black", weight=3];
650[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];650 -> 660[label="",style="solid", color="black", weight=3];
698[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];698 -> 706[label="",style="solid", color="black", weight=3];
699[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];699 -> 707[label="",style="solid", color="black", weight=3];
651[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (fromInt (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];651 -> 661[label="",style="solid", color="black", weight=3];
720[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];720 -> 728[label="",style="solid", color="black", weight=3];
727[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];727 -> 735[label="",style="solid", color="black", weight=3];
700[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not (compare (Integer (Pos (Succ vuz8))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];700 -> 708[label="",style="solid", color="black", weight=3];
705[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpInt (Pos (Succ vuz8)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpInt (Pos (Succ vuz8)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];705 -> 713[label="",style="solid", color="black", weight=3];
660[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];660 -> 669[label="",style="solid", color="black", weight=3];
706[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not (compare (Integer (Pos (Succ vuz14))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];706 -> 714[label="",style="solid", color="black", weight=3];
707[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpInt (Pos (Succ vuz14)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpInt (Pos (Succ vuz14)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];707 -> 715[label="",style="solid", color="black", weight=3];
661[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (compare (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero)) == LT)))",fontsize=16,color="black",shape="box"];661 -> 670[label="",style="solid", color="black", weight=3];
728[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];728 -> 736[label="",style="solid", color="black", weight=3];
735[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];735 -> 743[label="",style="solid", color="black", weight=3];
708[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpInt (Pos (Succ vuz8)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpInt (Pos (Succ vuz8)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];708 -> 716[label="",style="solid", color="black", weight=3];
713[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpNat (Succ vuz8) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpNat (Succ vuz8) Zero == LT)))",fontsize=16,color="black",shape="box"];713 -> 721[label="",style="solid", color="black", weight=3];
669[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];669 -> 677[label="",style="solid", color="black", weight=3];
714[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpInt (Pos (Succ vuz14)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpInt (Pos (Succ vuz14)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];714 -> 722[label="",style="solid", color="black", weight=3];
715[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpNat (Succ vuz14) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpNat (Succ vuz14) Zero == LT)))",fontsize=16,color="black",shape="box"];715 -> 723[label="",style="solid", color="black", weight=3];
670[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpInt (Pos (Succ vuz3100)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];670 -> 678[label="",style="solid", color="black", weight=3];
736[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];736 -> 744[label="",style="solid", color="black", weight=3];
743[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];743 -> 751[label="",style="solid", color="black", weight=3];
716[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpNat (Succ vuz8) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not (primCmpNat (Succ vuz8) Zero == LT)))",fontsize=16,color="black",shape="box"];716 -> 724[label="",style="solid", color="black", weight=3];
721[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];721 -> 729[label="",style="solid", color="black", weight=3];
677[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];677 -> 685[label="",style="solid", color="black", weight=3];
722[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpNat (Succ vuz14) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not (primCmpNat (Succ vuz14) Zero == LT)))",fontsize=16,color="black",shape="box"];722 -> 730[label="",style="solid", color="black", weight=3];
723[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];723 -> 731[label="",style="solid", color="black", weight=3];
678[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (primCmpNat (Succ vuz3100) Zero == LT)))",fontsize=16,color="black",shape="box"];678 -> 686[label="",style="solid", color="black", weight=3];
744[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Pos vuz16))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];744 -> 752[label="",style="solid", color="black", weight=3];
751[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg vuz30))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];751 -> 759[label="",style="solid", color="black", weight=3];
724[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];724 -> 732[label="",style="solid", color="black", weight=3];
729[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) (not False))",fontsize=16,color="black",shape="box"];729 -> 737[label="",style="solid", color="black", weight=3];
685[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];685 -> 693[label="",style="solid", color="black", weight=3];
730[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];730 -> 738[label="",style="solid", color="black", weight=3];
731[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) (not False))",fontsize=16,color="black",shape="box"];731 -> 739[label="",style="solid", color="black", weight=3];
686[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];686 -> 694[label="",style="solid", color="black", weight=3];
752[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Pos vuz16))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];752 -> 760[label="",style="solid", color="black", weight=3];
759[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg vuz30))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];759 -> 767[label="",style="solid", color="black", weight=3];
732[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) (not False))",fontsize=16,color="black",shape="box"];732 -> 740[label="",style="solid", color="black", weight=3];
737[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) True == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz8))) True)",fontsize=16,color="black",shape="box"];737 -> 745[label="",style="solid", color="black", weight=3];
693[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];693 -> 701[label="",style="solid", color="black", weight=3];
738[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) (not False))",fontsize=16,color="black",shape="box"];738 -> 746[label="",style="solid", color="black", weight=3];
739[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) True == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (absReal1 (Integer (Pos (Succ vuz14))) True)",fontsize=16,color="black",shape="box"];739 -> 747[label="",style="solid", color="black", weight=3];
694[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) (not False) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) (not False))",fontsize=16,color="black",shape="box"];694 -> 702[label="",style="solid", color="black", weight=3];
760[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Pos vuz16))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];760 -> 768[label="",style="solid", color="black", weight=3];
767[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg vuz30))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];767 -> 775[label="",style="solid", color="black", weight=3];
740[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz8))) True == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (absReal1 (Integer (Pos (Succ vuz8))) True)",fontsize=16,color="black",shape="box"];740 -> 748[label="",style="solid", color="black", weight=3];
745[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];745 -> 753[label="",style="solid", color="black", weight=3];
701[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];701 -> 709[label="",style="solid", color="black", weight=3];
746[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz14))) True == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (absReal1 (Integer (Pos (Succ vuz14))) True)",fontsize=16,color="black",shape="box"];746 -> 754[label="",style="solid", color="black", weight=3];
747[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];747 -> 755[label="",style="solid", color="black", weight=3];
702[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz3100))) True == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (absReal1 (Integer (Pos (Succ vuz3100))) True)",fontsize=16,color="black",shape="box"];702 -> 710[label="",style="solid", color="black", weight=3];
768[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Pos vuz16))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];768 -> 776[label="",style="solid", color="black", weight=3];
775[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 False (abs (Integer (Neg vuz30))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];775 -> 783[label="",style="solid", color="black", weight=3];
748[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];748 -> 756[label="",style="solid", color="black", weight=3];
753[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz8)) == Integer (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];753 -> 761[label="",style="solid", color="black", weight=3];
709[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];709 -> 717[label="",style="solid", color="black", weight=3];
754[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];754 -> 762[label="",style="solid", color="black", weight=3];
755[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz14)) == Integer (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];755 -> 763[label="",style="solid", color="black", weight=3];
710[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (abs (Integer (Neg Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];710 -> 718[label="",style="solid", color="black", weight=3];
776[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Pos vuz16))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];776 -> 784[label="",style="solid", color="black", weight=3];
783[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'0 (abs (Integer (Neg vuz30))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];783 -> 791[label="",style="solid", color="black", weight=3];
756[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz8)) == Integer (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];756 -> 764[label="",style="solid", color="black", weight=3];
761[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz8)) (Pos Zero)) (abs (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];761 -> 769[label="",style="solid", color="black", weight=3];
717[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];717 -> 725[label="",style="solid", color="black", weight=3];
762[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz14)) == Integer (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];762 -> 770[label="",style="solid", color="black", weight=3];
763[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz14)) (Pos Zero)) (abs (Integer (Neg (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];763 -> 771[label="",style="solid", color="black", weight=3];
718[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz3100)) == Integer (Pos Zero)) (abs (Integer (Neg Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];718 -> 726[label="",style="solid", color="black", weight=3];
784[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];784 -> 792[label="",style="solid", color="black", weight=3];
791[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];791 -> 799[label="",style="solid", color="black", weight=3];
764[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz8)) (Pos Zero)) (abs (Integer (Pos (Succ (Succ vuz47))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];764 -> 772[label="",style="solid", color="black", weight=3];
769[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 False (abs (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];769 -> 777[label="",style="solid", color="black", weight=3];
725[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];725 -> 733[label="",style="solid", color="black", weight=3];
770[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz14)) (Pos Zero)) (abs (Integer (Neg (Succ (Succ vuz45))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];770 -> 778[label="",style="solid", color="black", weight=3];
771[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 False (abs (Integer (Neg (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];771 -> 779[label="",style="solid", color="black", weight=3];
726[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ vuz3100)) (Pos Zero)) (abs (Integer (Neg Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];726 -> 734[label="",style="solid", color="black", weight=3];
792[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];792 -> 800[label="",style="solid", color="black", weight=3];
799[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];799 -> 807[label="",style="solid", color="black", weight=3];
772[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 False (abs (Integer (Pos (Succ (Succ vuz47))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];772 -> 780[label="",style="solid", color="black", weight=3];
777[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'0 (abs (Integer (Pos (Succ Zero)))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];777 -> 785[label="",style="solid", color="black", weight=3];
733[label="Integer (Pos Zero) `quot` gcd0Gcd'1 False (abs (Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];733 -> 741[label="",style="solid", color="black", weight=3];
778[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 False (abs (Integer (Neg (Succ (Succ vuz45))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];778 -> 786[label="",style="solid", color="black", weight=3];
779[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'0 (abs (Integer (Neg (Succ Zero)))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];779 -> 787[label="",style="solid", color="black", weight=3];
734[label="Integer (Neg Zero) `quot` gcd0Gcd'1 False (abs (Integer (Neg Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];734 -> 742[label="",style="solid", color="black", weight=3];
800[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];800 -> 808[label="",style="solid", color="black", weight=3];
807[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (abs (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];807 -> 815[label="",style="solid", color="black", weight=3];
780[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'0 (abs (Integer (Pos (Succ (Succ vuz47))))) (Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];780 -> 788[label="",style="solid", color="black", weight=3];
785[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];785 -> 793[label="",style="solid", color="black", weight=3];
741[label="Integer (Pos Zero) `quot` gcd0Gcd'0 (abs (Integer (Pos Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];741 -> 749[label="",style="solid", color="black", weight=3];
786[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'0 (abs (Integer (Neg (Succ (Succ vuz45))))) (Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];786 -> 794[label="",style="solid", color="black", weight=3];
787[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];787 -> 795[label="",style="solid", color="black", weight=3];
742[label="Integer (Neg Zero) `quot` gcd0Gcd'0 (abs (Integer (Neg Zero))) (Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];742 -> 750[label="",style="solid", color="black", weight=3];
808[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];808 -> 816[label="",style="solid", color="black", weight=3];
815[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];815 -> 823[label="",style="solid", color="black", weight=3];
788[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd' (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];788 -> 796[label="",style="solid", color="black", weight=3];
793[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];793 -> 801[label="",style="solid", color="black", weight=3];
749[label="Integer (Pos Zero) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];749 -> 757[label="",style="solid", color="black", weight=3];
794[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd' (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];794 -> 802[label="",style="solid", color="black", weight=3];
795[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];795 -> 803[label="",style="solid", color="black", weight=3];
750[label="Integer (Neg Zero) `quot` gcd0Gcd' (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];750 -> 758[label="",style="solid", color="black", weight=3];
816[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Pos vuz16)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];816 -> 824[label="",style="solid", color="black", weight=3];
823[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg vuz30)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];823 -> 831[label="",style="solid", color="black", weight=3];
796[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];796 -> 804[label="",style="solid", color="black", weight=3];
801[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];801 -> 809[label="",style="solid", color="black", weight=3];
757[label="Integer (Pos Zero) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];757 -> 765[label="",style="solid", color="black", weight=3];
802[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];802 -> 810[label="",style="solid", color="black", weight=3];
803[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (abs (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];803 -> 811[label="",style="solid", color="black", weight=3];
758[label="Integer (Neg Zero) `quot` gcd0Gcd'2 (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];758 -> 766[label="",style="solid", color="black", weight=3];
824[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz16)) (Integer (Pos vuz16) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz16)) (Integer (Pos vuz16) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];824 -> 832[label="",style="solid", color="black", weight=3];
831[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz30)) (Integer (Neg vuz30) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz30)) (Integer (Neg vuz30) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];831 -> 839[label="",style="solid", color="black", weight=3];
804[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (abs (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (abs (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];804 -> 812[label="",style="solid", color="black", weight=3];
809[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];809 -> 817[label="",style="solid", color="black", weight=3];
765[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (abs (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];765 -> 773[label="",style="solid", color="black", weight=3];
810[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (abs (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (abs (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];810 -> 818[label="",style="solid", color="black", weight=3];
811[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];811 -> 819[label="",style="solid", color="black", weight=3];
766[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (abs (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (abs (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];766 -> 774[label="",style="solid", color="black", weight=3];
832[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz16)) (compare (Integer (Pos vuz16)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz16)) (compare (Integer (Pos vuz16)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];832 -> 840[label="",style="solid", color="black", weight=3];
839[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz30)) (compare (Integer (Neg vuz30)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz30)) (compare (Integer (Neg vuz30)) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];839 -> 851[label="",style="solid", color="black", weight=3];
812[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];812 -> 820[label="",style="solid", color="black", weight=3];
817[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal2 (Integer (Pos (Succ Zero))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];817 -> 825[label="",style="solid", color="black", weight=3];
773[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];773 -> 781[label="",style="solid", color="black", weight=3];
818[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];818 -> 826[label="",style="solid", color="black", weight=3];
819[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal2 (Integer (Neg (Succ Zero))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];819 -> 827[label="",style="solid", color="black", weight=3];
774[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];774 -> 782[label="",style="solid", color="black", weight=3];
840[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz16)) (not (compare (Integer (Pos vuz16)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz16)) (not (compare (Integer (Pos vuz16)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];840 -> 852[label="",style="solid", color="black", weight=3];
851[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz30)) (not (compare (Integer (Neg vuz30)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz30)) (not (compare (Integer (Neg vuz30)) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];851 -> 856[label="",style="solid", color="black", weight=3];
820[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal2 (Integer (Pos (Succ (Succ vuz47)))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];820 -> 828[label="",style="solid", color="black", weight=3];
825 -> 842[label="",style="dashed", color="red", weight=0];
825[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ Zero)) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="magenta"];825 -> 843[label="",style="dashed", color="magenta", weight=3];
825 -> 844[label="",style="dashed", color="magenta", weight=3];
781[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal2 (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];781 -> 789[label="",style="solid", color="black", weight=3];
826[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal2 (Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];826 -> 834[label="",style="solid", color="black", weight=3];
827 -> 842[label="",style="dashed", color="red", weight=0];
827[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ Zero))) (Integer (Neg (Succ Zero)) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ Zero))) (Integer (Neg (Succ Zero)) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="magenta"];827 -> 845[label="",style="dashed", color="magenta", weight=3];
827 -> 846[label="",style="dashed", color="magenta", weight=3];
782[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal2 (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal2 (Integer (Neg Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];782 -> 790[label="",style="solid", color="black", weight=3];
852[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz16)) (not (compare (Integer (Pos vuz16)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz16)) (not (compare (Integer (Pos vuz16)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];852 -> 857[label="",style="solid", color="black", weight=3];
856[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz30)) (not (compare (Integer (Neg vuz30)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz30)) (not (compare (Integer (Neg vuz30)) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];856 -> 861[label="",style="solid", color="black", weight=3];
828[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (Integer (Pos (Succ (Succ vuz47))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (Integer (Pos (Succ (Succ vuz47))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];828 -> 836[label="",style="solid", color="black", weight=3];
843[label="Integer (Pos (Succ Zero))",fontsize=16,color="green",shape="box"];844[label="vuz8",fontsize=16,color="green",shape="box"];842[label="vuz49 `quot` gcd0Gcd'1 (absReal1 vuz49 (vuz49 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 vuz49 (vuz49 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="burlywood",shape="triangle"];2869[label="vuz49/Integer vuz490",fontsize=10,color="white",style="solid",shape="box"];842 -> 2869[label="",style="solid", color="burlywood", weight=9];
2869 -> 853[label="",style="solid", color="burlywood", weight=3];
789 -> 842[label="",style="dashed", color="red", weight=0];
789[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (Integer (Pos Zero) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (Integer (Pos Zero) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];789 -> 847[label="",style="dashed", color="magenta", weight=3];
789 -> 848[label="",style="dashed", color="magenta", weight=3];
834[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (Integer (Neg (Succ (Succ vuz45))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (Integer (Neg (Succ (Succ vuz45))) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];834 -> 854[label="",style="solid", color="black", weight=3];
845[label="Integer (Neg (Succ Zero))",fontsize=16,color="green",shape="box"];846[label="vuz14",fontsize=16,color="green",shape="box"];790 -> 842[label="",style="dashed", color="red", weight=0];
790[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (Integer (Neg Zero) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (Integer (Neg Zero) >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="magenta"];790 -> 849[label="",style="dashed", color="magenta", weight=3];
790 -> 850[label="",style="dashed", color="magenta", weight=3];
857[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz16)) (not (primCmpInt (Pos vuz16) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos vuz16)) (not (primCmpInt (Pos vuz16) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2872[label="vuz16/Succ vuz160",fontsize=10,color="white",style="solid",shape="box"];857 -> 2872[label="",style="solid", color="burlywood", weight=9];
2872 -> 862[label="",style="solid", color="burlywood", weight=3];
2873[label="vuz16/Zero",fontsize=10,color="white",style="solid",shape="box"];857 -> 2873[label="",style="solid", color="burlywood", weight=9];
2873 -> 863[label="",style="solid", color="burlywood", weight=3];
861[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz30)) (not (primCmpInt (Neg vuz30) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg vuz30)) (not (primCmpInt (Neg vuz30) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="burlywood",shape="box"];2874[label="vuz30/Succ vuz300",fontsize=10,color="white",style="solid",shape="box"];861 -> 2874[label="",style="solid", color="burlywood", weight=9];
2874 -> 867[label="",style="solid", color="burlywood", weight=3];
2875[label="vuz30/Zero",fontsize=10,color="white",style="solid",shape="box"];861 -> 2875[label="",style="solid", color="burlywood", weight=9];
2875 -> 868[label="",style="solid", color="burlywood", weight=3];
836[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (compare (Integer (Pos (Succ (Succ vuz47)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (compare (Integer (Pos (Succ (Succ vuz47)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];836 -> 855[label="",style="solid", color="black", weight=3];
853[label="Integer vuz490 `quot` gcd0Gcd'1 (absReal1 (Integer vuz490) (Integer vuz490 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer vuz490) (Integer vuz490 >= fromInt (Pos Zero)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];853 -> 858[label="",style="solid", color="black", weight=3];
847[label="Integer (Pos Zero)",fontsize=16,color="green",shape="box"];848[label="vuz3100",fontsize=16,color="green",shape="box"];854[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (compare (Integer (Neg (Succ (Succ vuz45)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (compare (Integer (Neg (Succ (Succ vuz45)))) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];854 -> 859[label="",style="solid", color="black", weight=3];
849[label="Integer (Neg Zero)",fontsize=16,color="green",shape="box"];850[label="vuz3100",fontsize=16,color="green",shape="box"];862[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz160))) (not (primCmpInt (Pos (Succ vuz160)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz160))) (not (primCmpInt (Pos (Succ vuz160)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];862 -> 869[label="",style="solid", color="black", weight=3];
863[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];863 -> 870[label="",style="solid", color="black", weight=3];
867[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz300))) (not (primCmpInt (Neg (Succ vuz300)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz300))) (not (primCmpInt (Neg (Succ vuz300)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];867 -> 874[label="",style="solid", color="black", weight=3];
868[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];868 -> 875[label="",style="solid", color="black", weight=3];
855[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (compare (Integer (Pos (Succ (Succ vuz47)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (compare (Integer (Pos (Succ (Succ vuz47)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];855 -> 860[label="",style="solid", color="black", weight=3];
858[label="Integer vuz490 `quot` gcd0Gcd'1 (absReal1 (Integer vuz490) (compare (Integer vuz490) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer vuz490) (compare (Integer vuz490) (fromInt (Pos Zero)) /= LT) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];858 -> 864[label="",style="solid", color="black", weight=3];
859[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (compare (Integer (Neg (Succ (Succ vuz45)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (compare (Integer (Neg (Succ (Succ vuz45)))) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];859 -> 865[label="",style="solid", color="black", weight=3];
869[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz160))) (not (primCmpNat (Succ vuz160) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz160))) (not (primCmpNat (Succ vuz160) Zero == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];869 -> 876[label="",style="solid", color="black", weight=3];
870[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];870 -> 877[label="",style="solid", color="black", weight=3];
874[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz300))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz300))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];874 -> 881[label="",style="solid", color="black", weight=3];
875[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];875 -> 882[label="",style="solid", color="black", weight=3];
860[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (compare (Integer (Pos (Succ (Succ vuz47)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (compare (Integer (Pos (Succ (Succ vuz47)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];860 -> 866[label="",style="solid", color="black", weight=3];
864[label="Integer vuz490 `quot` gcd0Gcd'1 (absReal1 (Integer vuz490) (not (compare (Integer vuz490) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer vuz490) (not (compare (Integer vuz490) (fromInt (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];864 -> 871[label="",style="solid", color="black", weight=3];
865[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (compare (Integer (Neg (Succ (Succ vuz45)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (compare (Integer (Neg (Succ (Succ vuz45)))) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];865 -> 872[label="",style="solid", color="black", weight=3];
876[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz160))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz160))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];876 -> 883[label="",style="solid", color="black", weight=3];
877[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];877 -> 884[label="",style="solid", color="black", weight=3];
881[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz300))) (not True) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz300))) (not True) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];881 -> 889[label="",style="solid", color="black", weight=3];
882[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];882 -> 890[label="",style="solid", color="black", weight=3];
866[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (primCmpInt (Pos (Succ (Succ vuz47))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (primCmpInt (Pos (Succ (Succ vuz47))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];866 -> 873[label="",style="solid", color="black", weight=3];
871[label="Integer vuz490 `quot` gcd0Gcd'1 (absReal1 (Integer vuz490) (not (compare (Integer vuz490) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer vuz490) (not (compare (Integer vuz490) (Integer (Pos Zero)) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];871 -> 878[label="",style="solid", color="black", weight=3];
872[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (primCmpInt (Neg (Succ (Succ vuz45))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (primCmpInt (Neg (Succ (Succ vuz45))) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];872 -> 879[label="",style="solid", color="black", weight=3];
883[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz160))) (not False) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz160))) (not False) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];883 -> 891[label="",style="solid", color="black", weight=3];
884[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];884 -> 892[label="",style="solid", color="black", weight=3];
889[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz300))) False `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg (Succ vuz300))) False `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];889 -> 899[label="",style="solid", color="black", weight=3];
890[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];890 -> 900[label="",style="solid", color="black", weight=3];
873[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (primCmpNat (Succ (Succ vuz47)) Zero == LT)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (primCmpNat (Succ (Succ vuz47)) Zero == LT)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];873 -> 880[label="",style="solid", color="black", weight=3];
878[label="Integer vuz490 `quot` gcd0Gcd'1 (absReal1 (Integer vuz490) (not (primCmpInt vuz490 (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer vuz490) (not (primCmpInt vuz490 (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="burlywood",shape="box"];2876[label="vuz490/Pos vuz4900",fontsize=10,color="white",style="solid",shape="box"];878 -> 2876[label="",style="solid", color="burlywood", weight=9];
2876 -> 885[label="",style="solid", color="burlywood", weight=3];
2877[label="vuz490/Neg vuz4900",fontsize=10,color="white",style="solid",shape="box"];878 -> 2877[label="",style="solid", color="burlywood", weight=9];
2877 -> 886[label="",style="solid", color="burlywood", weight=3];
879[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];879 -> 887[label="",style="solid", color="black", weight=3];
891[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz160))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal1 (Integer (Pos (Succ vuz160))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];891 -> 901[label="",style="solid", color="black", weight=3];
892[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];892 -> 902[label="",style="solid", color="black", weight=3];
899[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz300))) otherwise `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz300))) otherwise `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];899 -> 909[label="",style="solid", color="black", weight=3];
900[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];900 -> 910[label="",style="solid", color="black", weight=3];
880[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];880 -> 888[label="",style="solid", color="black", weight=3];
885[label="Integer (Pos vuz4900) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos vuz4900)) (not (primCmpInt (Pos vuz4900) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos vuz4900)) (not (primCmpInt (Pos vuz4900) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="burlywood",shape="box"];2878[label="vuz4900/Succ vuz49000",fontsize=10,color="white",style="solid",shape="box"];885 -> 2878[label="",style="solid", color="burlywood", weight=9];
2878 -> 893[label="",style="solid", color="burlywood", weight=3];
2879[label="vuz4900/Zero",fontsize=10,color="white",style="solid",shape="box"];885 -> 2879[label="",style="solid", color="burlywood", weight=9];
2879 -> 894[label="",style="solid", color="burlywood", weight=3];
886[label="Integer (Neg vuz4900) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg vuz4900)) (not (primCmpInt (Neg vuz4900) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg vuz4900)) (not (primCmpInt (Neg vuz4900) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="burlywood",shape="box"];2880[label="vuz4900/Succ vuz49000",fontsize=10,color="white",style="solid",shape="box"];886 -> 2880[label="",style="solid", color="burlywood", weight=9];
2880 -> 895[label="",style="solid", color="burlywood", weight=3];
2881[label="vuz4900/Zero",fontsize=10,color="white",style="solid",shape="box"];886 -> 2881[label="",style="solid", color="burlywood", weight=9];
2881 -> 896[label="",style="solid", color="burlywood", weight=3];
887[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not True) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) (not True) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];887 -> 897[label="",style="solid", color="black", weight=3];
901[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz160)) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (Succ vuz160)) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="triangle"];901 -> 911[label="",style="solid", color="black", weight=3];
902[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];902 -> 912[label="",style="solid", color="black", weight=3];
909[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz300))) True `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (absReal0 (Integer (Neg (Succ vuz300))) True `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];909 -> 919[label="",style="solid", color="black", weight=3];
910[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];910 -> 920[label="",style="solid", color="black", weight=3];
888[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not False) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) (not False) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];888 -> 898[label="",style="solid", color="black", weight=3];
893[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz49000))) (not (primCmpInt (Pos (Succ vuz49000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos (Succ vuz49000))) (not (primCmpInt (Pos (Succ vuz49000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];893 -> 903[label="",style="solid", color="black", weight=3];
894[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];894 -> 904[label="",style="solid", color="black", weight=3];
895[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz49000))) (not (primCmpInt (Neg (Succ vuz49000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg (Succ vuz49000))) (not (primCmpInt (Neg (Succ vuz49000)) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];895 -> 905[label="",style="solid", color="black", weight=3];
896[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg Zero)) (not (primCmpInt (Neg Zero) (Pos Zero) == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];896 -> 906[label="",style="solid", color="black", weight=3];
897[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ (Succ vuz45)))) False `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal1 (Integer (Neg (Succ (Succ vuz45)))) False `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];897 -> 907[label="",style="solid", color="black", weight=3];
911[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];911 -> 921[label="",style="solid", color="black", weight=3];
912[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];912 -> 922[label="",style="solid", color="black", weight=3];
919[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz300))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) ((`negate` Integer (Neg (Succ vuz300))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];919 -> 929[label="",style="solid", color="black", weight=3];
920[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];920 -> 930[label="",style="solid", color="black", weight=3];
898[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ (Succ vuz47)))) True `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (absReal1 (Integer (Pos (Succ (Succ vuz47)))) True `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="box"];898 -> 908[label="",style="solid", color="black", weight=3];
903[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz49000))) (not (primCmpNat (Succ vuz49000) Zero == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos (Succ vuz49000))) (not (primCmpNat (Succ vuz49000) Zero == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];903 -> 913[label="",style="solid", color="black", weight=3];
904[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];904 -> 914[label="",style="solid", color="black", weight=3];
905[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz49000))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg (Succ vuz49000))) (not (LT == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];905 -> 915[label="",style="solid", color="black", weight=3];
906[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg Zero)) (not (EQ == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];906 -> 916[label="",style="solid", color="black", weight=3];
907[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ (Succ vuz45)))) otherwise `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal0 (Integer (Neg (Succ (Succ vuz45)))) otherwise `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];907 -> 917[label="",style="solid", color="black", weight=3];
921[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];921 -> 931[label="",style="solid", color="black", weight=3];
922[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];922 -> 932[label="",style="solid", color="black", weight=3];
929[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz300))) `rem` Integer (Pos (Succ vuz3100)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primNegInt (Neg (Succ vuz300))) `rem` Integer (Pos (Succ vuz3100)))",fontsize=16,color="black",shape="box"];929 -> 939[label="",style="solid", color="black", weight=3];
930[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];930 -> 940[label="",style="solid", color="black", weight=3];
908[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz47))) `rem` Integer (Pos (Succ vuz8)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (Pos (Succ (Succ vuz47))) `rem` Integer (Pos (Succ vuz8)))",fontsize=16,color="black",shape="triangle"];908 -> 918[label="",style="solid", color="black", weight=3];
913[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz49000))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos (Succ vuz49000))) (not (GT == LT)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];913 -> 923[label="",style="solid", color="black", weight=3];
914[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos Zero)) (not False) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];914 -> 924[label="",style="solid", color="black", weight=3];
915[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz49000))) (not True) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg (Succ vuz49000))) (not True) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];915 -> 925[label="",style="solid", color="black", weight=3];
916[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg Zero)) (not False) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];916 -> 926[label="",style="solid", color="black", weight=3];
917[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ (Succ vuz45)))) True `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (absReal0 (Integer (Neg (Succ (Succ vuz45)))) True `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];917 -> 927[label="",style="solid", color="black", weight=3];
931[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz160)) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];931 -> 941[label="",style="solid", color="black", weight=3];
932[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];932 -> 942[label="",style="solid", color="black", weight=3];
939[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];939 -> 949[label="",style="solid", color="black", weight=3];
940[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg (primModNatS Zero (Succ vuz3100))))",fontsize=16,color="black",shape="box"];940 -> 950[label="",style="solid", color="black", weight=3];
918[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];918 -> 928[label="",style="solid", color="black", weight=3];
923[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz49000))) (not False) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos (Succ vuz49000))) (not False) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];923 -> 933[label="",style="solid", color="black", weight=3];
924[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos Zero)) True `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];924 -> 934[label="",style="solid", color="black", weight=3];
925[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg (Succ vuz49000))) False `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg (Succ vuz49000))) False `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];925 -> 935[label="",style="solid", color="black", weight=3];
926[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Neg Zero)) True `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];926 -> 936[label="",style="solid", color="black", weight=3];
927[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) ((`negate` Integer (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];927 -> 937[label="",style="solid", color="black", weight=3];
941[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz160) (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS (Succ vuz160) (Succ vuz3100))))",fontsize=16,color="black",shape="triangle"];941 -> 951[label="",style="solid", color="black", weight=3];
942[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];942 -> 952[label="",style="solid", color="black", weight=3];
949[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];949 -> 959[label="",style="solid", color="black", weight=3];
950[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];950 -> 960[label="",style="solid", color="black", weight=3];
928[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];928 -> 938[label="",style="solid", color="black", weight=3];
933[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal1 (Integer (Pos (Succ vuz49000))) True `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal1 (Integer (Pos (Succ vuz49000))) True `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];933 -> 943[label="",style="solid", color="black", weight=3];
934[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos Zero) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];934 -> 944[label="",style="solid", color="black", weight=3];
935[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz49000))) otherwise `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal0 (Integer (Neg (Succ vuz49000))) otherwise `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];935 -> 945[label="",style="solid", color="black", weight=3];
936[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Neg Zero) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];936 -> 946[label="",style="solid", color="black", weight=3];
937[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (primNegInt (Neg (Succ (Succ vuz45)))) `rem` Integer (Pos (Succ vuz14)))",fontsize=16,color="black",shape="box"];937 -> 947[label="",style="solid", color="black", weight=3];
951[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz160 vuz3100 (primGEqNatS vuz160 vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 vuz160 vuz3100 (primGEqNatS vuz160 vuz3100))))",fontsize=16,color="burlywood",shape="box"];2882[label="vuz160/Succ vuz1600",fontsize=10,color="white",style="solid",shape="box"];951 -> 2882[label="",style="solid", color="burlywood", weight=9];
2882 -> 961[label="",style="solid", color="burlywood", weight=3];
2883[label="vuz160/Zero",fontsize=10,color="white",style="solid",shape="box"];951 -> 2883[label="",style="solid", color="burlywood", weight=9];
2883 -> 962[label="",style="solid", color="burlywood", weight=3];
952[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];952 -> 963[label="",style="solid", color="black", weight=3];
959[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (primNegInt (Neg (Succ vuz300))) (Pos (Succ vuz3100))))",fontsize=16,color="black",shape="box"];959 -> 971[label="",style="solid", color="black", weight=3];
960[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz3100))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];960 -> 972[label="",style="solid", color="black", weight=3];
938[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))) (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (primRemInt (Pos (Succ (Succ vuz47))) (Pos (Succ vuz8))))",fontsize=16,color="black",shape="box"];938 -> 948[label="",style="solid", color="black", weight=3];
943[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz49000)) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (Succ vuz49000)) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="triangle"];943 -> 953[label="",style="solid", color="black", weight=3];
944[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz50))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];944 -> 954[label="",style="solid", color="black", weight=3];
945[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (absReal0 (Integer (Neg (Succ vuz49000))) True `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (absReal0 (Integer (Neg (Succ vuz49000))) True `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];945 -> 955[label="",style="solid", color="black", weight=3];
946[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz50))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];946 -> 956[label="",style="solid", color="black", weight=3];
947[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];947 -> 957[label="",style="solid", color="black", weight=3];
961[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz1600) vuz3100 (primGEqNatS (Succ vuz1600) vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 (Succ vuz1600) vuz3100 (primGEqNatS (Succ vuz1600) vuz3100))))",fontsize=16,color="burlywood",shape="box"];2884[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];961 -> 2884[label="",style="solid", color="burlywood", weight=9];
2884 -> 973[label="",style="solid", color="burlywood", weight=3];
2885[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];961 -> 2885[label="",style="solid", color="burlywood", weight=9];
2885 -> 974[label="",style="solid", color="burlywood", weight=3];
962[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (Pos (primModNatS0 Zero vuz3100 (primGEqNatS Zero vuz3100))))",fontsize=16,color="burlywood",shape="box"];2886[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];962 -> 2886[label="",style="solid", color="burlywood", weight=9];
2886 -> 975[label="",style="solid", color="burlywood", weight=3];
2887[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];962 -> 2887[label="",style="solid", color="burlywood", weight=9];
2887 -> 976[label="",style="solid", color="burlywood", weight=3];
963[label="Integer (Pos (Succ vuz3100)) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="black",shape="triangle"];963 -> 977[label="",style="solid", color="black", weight=3];
971 -> 931[label="",style="dashed", color="red", weight=0];
971[label="Integer (Pos (Succ vuz3100)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz300)) (Pos (Succ vuz3100))) (Pos Zero)) (Integer (Pos (Succ vuz3100))) (Integer (primRemInt (Pos (Succ vuz300)) (Pos (Succ vuz3100))))",fontsize=16,color="magenta"];971 -> 985[label="",style="dashed", color="magenta", weight=3];
972 -> 963[label="",style="dashed", color="red", weight=0];
972[label="Integer (Pos (Succ vuz3100)) `quot` Integer (Pos (Succ vuz3100))",fontsize=16,color="magenta"];948[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz47)) (Succ vuz8))) (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (Pos (primModNatS (Succ (Succ vuz47)) (Succ vuz8))))",fontsize=16,color="black",shape="box"];948 -> 958[label="",style="solid", color="black", weight=3];
953[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];953 -> 964[label="",style="solid", color="black", weight=3];
954[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos Zero) (Pos (Succ vuz50))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];954 -> 965[label="",style="solid", color="black", weight=3];
955[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 ((`negate` Integer (Neg (Succ vuz49000))) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) ((`negate` Integer (Neg (Succ vuz49000))) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];955 -> 966[label="",style="solid", color="black", weight=3];
956[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (Integer (primRemInt (Neg Zero) (Pos (Succ vuz50))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];956 -> 967[label="",style="solid", color="black", weight=3];
957[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];957 -> 968[label="",style="solid", color="black", weight=3];
973[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz1600) (Succ vuz31000) (primGEqNatS (Succ vuz1600) (Succ vuz31000)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 (Succ vuz1600) (Succ vuz31000) (primGEqNatS (Succ vuz1600) (Succ vuz31000)))))",fontsize=16,color="black",shape="box"];973 -> 986[label="",style="solid", color="black", weight=3];
974[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz1600) Zero (primGEqNatS (Succ vuz1600) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz1600) Zero (primGEqNatS (Succ vuz1600) Zero))))",fontsize=16,color="black",shape="box"];974 -> 987[label="",style="solid", color="black", weight=3];
975[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 Zero (Succ vuz31000) (primGEqNatS Zero (Succ vuz31000)))))",fontsize=16,color="black",shape="box"];975 -> 988[label="",style="solid", color="black", weight=3];
976[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];976 -> 989[label="",style="solid", color="black", weight=3];
977[label="Integer (primQuotInt (Pos (Succ vuz3100)) (Pos (Succ vuz3100)))",fontsize=16,color="green",shape="box"];977 -> 990[label="",style="dashed", color="green", weight=3];
985[label="vuz300",fontsize=16,color="green",shape="box"];958 -> 1940[label="",style="dashed", color="red", weight=0];
958[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz47) vuz8 (primGEqNatS (Succ vuz47) vuz8))) (Pos Zero)) (Integer (Pos (Succ vuz8))) (Integer (Pos (primModNatS0 (Succ vuz47) vuz8 (primGEqNatS (Succ vuz47) vuz8))))",fontsize=16,color="magenta"];958 -> 1941[label="",style="dashed", color="magenta", weight=3];
958 -> 1942[label="",style="dashed", color="magenta", weight=3];
958 -> 1943[label="",style="dashed", color="magenta", weight=3];
958 -> 1944[label="",style="dashed", color="magenta", weight=3];
958 -> 1945[label="",style="dashed", color="magenta", weight=3];
964[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];964 -> 978[label="",style="solid", color="black", weight=3];
965[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos Zero) (Pos (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];965 -> 979[label="",style="solid", color="black", weight=3];
966[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (primNegInt (Neg (Succ vuz49000))) `rem` Integer (Pos (Succ vuz50)) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primNegInt (Neg (Succ vuz49000))) `rem` Integer (Pos (Succ vuz50)))",fontsize=16,color="black",shape="box"];966 -> 980[label="",style="solid", color="black", weight=3];
967[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Neg Zero) (Pos (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Neg Zero) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];967 -> 981[label="",style="solid", color="black", weight=3];
968[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))) (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (primRemInt (primNegInt (Neg (Succ (Succ vuz45)))) (Pos (Succ vuz14))))",fontsize=16,color="black",shape="box"];968 -> 982[label="",style="solid", color="black", weight=3];
986 -> 1940[label="",style="dashed", color="red", weight=0];
986[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz1600) (Succ vuz31000) (primGEqNatS vuz1600 vuz31000))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 (Succ vuz1600) (Succ vuz31000) (primGEqNatS vuz1600 vuz31000))))",fontsize=16,color="magenta"];986 -> 1946[label="",style="dashed", color="magenta", weight=3];
986 -> 1947[label="",style="dashed", color="magenta", weight=3];
986 -> 1948[label="",style="dashed", color="magenta", weight=3];
986 -> 1949[label="",style="dashed", color="magenta", weight=3];
986 -> 1950[label="",style="dashed", color="magenta", weight=3];
987[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz1600) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz1600) Zero True)))",fontsize=16,color="black",shape="box"];987 -> 1002[label="",style="solid", color="black", weight=3];
988[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz31000) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (primModNatS0 Zero (Succ vuz31000) False)))",fontsize=16,color="black",shape="box"];988 -> 1003[label="",style="solid", color="black", weight=3];
989 -> 1205[label="",style="dashed", color="red", weight=0];
989[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];989 -> 1206[label="",style="dashed", color="magenta", weight=3];
990[label="primQuotInt (Pos (Succ vuz3100)) (Pos (Succ vuz3100))",fontsize=16,color="black",shape="box"];990 -> 1005[label="",style="solid", color="black", weight=3];
1941[label="vuz47",fontsize=16,color="green",shape="box"];1942[label="vuz8",fontsize=16,color="green",shape="box"];1943[label="Succ vuz47",fontsize=16,color="green",shape="box"];1944[label="vuz8",fontsize=16,color="green",shape="box"];1945[label="vuz46",fontsize=16,color="green",shape="box"];1940[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS vuz92 vuz93))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS vuz92 vuz93))))",fontsize=16,color="burlywood",shape="triangle"];2893[label="vuz92/Succ vuz920",fontsize=10,color="white",style="solid",shape="box"];1940 -> 2893[label="",style="solid", color="burlywood", weight=9];
2893 -> 2031[label="",style="solid", color="burlywood", weight=3];
2894[label="vuz92/Zero",fontsize=10,color="white",style="solid",shape="box"];1940 -> 2894[label="",style="solid", color="burlywood", weight=9];
2894 -> 2032[label="",style="solid", color="burlywood", weight=3];
978[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];978 -> 991[label="",style="solid", color="black", weight=3];
979[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS Zero (Succ vuz50))))",fontsize=16,color="black",shape="box"];979 -> 992[label="",style="solid", color="black", weight=3];
980[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))) == fromInt (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];980 -> 993[label="",style="solid", color="black", weight=3];
981[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (Neg (primModNatS Zero (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Neg (primModNatS Zero (Succ vuz50))))",fontsize=16,color="black",shape="box"];981 -> 994[label="",style="solid", color="black", weight=3];
982[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz45))) (Pos (Succ vuz14))) (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (primRemInt (Pos (Succ (Succ vuz45))) (Pos (Succ vuz14))))",fontsize=16,color="black",shape="triangle"];982 -> 995[label="",style="solid", color="black", weight=3];
1946[label="vuz1600",fontsize=16,color="green",shape="box"];1947[label="vuz31000",fontsize=16,color="green",shape="box"];1948[label="vuz1600",fontsize=16,color="green",shape="box"];1949[label="Succ vuz31000",fontsize=16,color="green",shape="box"];1950[label="vuz31000",fontsize=16,color="green",shape="box"];1002[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz1600) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz1600) Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];1002 -> 1016[label="",style="solid", color="black", weight=3];
1003 -> 1391[label="",style="dashed", color="red", weight=0];
1003[label="Integer (Pos (Succ (Succ vuz31000))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz31000)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];1003 -> 1392[label="",style="dashed", color="magenta", weight=3];
1003 -> 1393[label="",style="dashed", color="magenta", weight=3];
1206[label="Integer (Pos (Succ Zero))",fontsize=16,color="green",shape="box"];1205[label="vuz52 `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="burlywood",shape="triangle"];2896[label="vuz52/Integer vuz520",fontsize=10,color="white",style="solid",shape="box"];1205 -> 2896[label="",style="solid", color="burlywood", weight=9];
2896 -> 1211[label="",style="solid", color="burlywood", weight=3];
1005[label="Pos (primDivNatS (Succ vuz3100) (Succ vuz3100))",fontsize=16,color="green",shape="box"];1005 -> 1019[label="",style="dashed", color="green", weight=3];
2031[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) vuz93))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) vuz93))))",fontsize=16,color="burlywood",shape="box"];2897[label="vuz93/Succ vuz930",fontsize=10,color="white",style="solid",shape="box"];2031 -> 2897[label="",style="solid", color="burlywood", weight=9];
2897 -> 2060[label="",style="solid", color="burlywood", weight=3];
2898[label="vuz93/Zero",fontsize=10,color="white",style="solid",shape="box"];2031 -> 2898[label="",style="solid", color="burlywood", weight=9];
2898 -> 2061[label="",style="solid", color="burlywood", weight=3];
2032[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero vuz93))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero vuz93))))",fontsize=16,color="burlywood",shape="box"];2899[label="vuz93/Succ vuz930",fontsize=10,color="white",style="solid",shape="box"];2032 -> 2899[label="",style="solid", color="burlywood", weight=9];
2899 -> 2062[label="",style="solid", color="burlywood", weight=3];
2900[label="vuz93/Zero",fontsize=10,color="white",style="solid",shape="box"];2032 -> 2900[label="",style="solid", color="burlywood", weight=9];
2900 -> 2063[label="",style="solid", color="burlywood", weight=3];
991[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz49000) (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS (Succ vuz49000) (Succ vuz50))))",fontsize=16,color="black",shape="box"];991 -> 1006[label="",style="solid", color="black", weight=3];
992[label="Integer (Pos Zero) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];992 -> 1007[label="",style="solid", color="black", weight=3];
993[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (Integer (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))) == Integer (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];993 -> 1008[label="",style="solid", color="black", weight=3];
994[label="Integer (Neg Zero) `quot` gcd0Gcd'1 (primEqInt (Neg Zero) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];994 -> 1009[label="",style="solid", color="black", weight=3];
995 -> 2464[label="",style="dashed", color="red", weight=0];
995[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz45)) (Succ vuz14))) (Pos Zero)) (Integer (Pos (Succ vuz14))) (Integer (Pos (primModNatS (Succ (Succ vuz45)) (Succ vuz14))))",fontsize=16,color="magenta"];995 -> 2465[label="",style="dashed", color="magenta", weight=3];
995 -> 2466[label="",style="dashed", color="magenta", weight=3];
995 -> 2467[label="",style="dashed", color="magenta", weight=3];
995 -> 2468[label="",style="dashed", color="magenta", weight=3];
1016 -> 941[label="",style="dashed", color="red", weight=0];
1016[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1600) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz1600) (Succ Zero))))",fontsize=16,color="magenta"];1016 -> 1032[label="",style="dashed", color="magenta", weight=3];
1016 -> 1033[label="",style="dashed", color="magenta", weight=3];
1392[label="Succ vuz31000",fontsize=16,color="green",shape="box"];1393[label="vuz31000",fontsize=16,color="green",shape="box"];1391[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ vuz58))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="triangle"];1391 -> 1398[label="",style="solid", color="black", weight=3];
1211[label="Integer vuz520 `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="black",shape="box"];1211 -> 1240[label="",style="solid", color="black", weight=3];
1019[label="primDivNatS (Succ vuz3100) (Succ vuz3100)",fontsize=16,color="black",shape="box"];1019 -> 1036[label="",style="solid", color="black", weight=3];
2060[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) (Succ vuz930)))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) (Succ vuz930)))))",fontsize=16,color="black",shape="box"];2060 -> 2092[label="",style="solid", color="black", weight=3];
2061[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS (Succ vuz920) Zero))))",fontsize=16,color="black",shape="box"];2061 -> 2093[label="",style="solid", color="black", weight=3];
2062[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero (Succ vuz930)))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero (Succ vuz930)))))",fontsize=16,color="black",shape="box"];2062 -> 2094[label="",style="solid", color="black", weight=3];
2063[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2063 -> 2095[label="",style="solid", color="black", weight=3];
1006[label="Integer (Pos (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz49000 vuz50 (primGEqNatS vuz49000 vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 vuz49000 vuz50 (primGEqNatS vuz49000 vuz50))))",fontsize=16,color="burlywood",shape="box"];2903[label="vuz49000/Succ vuz490000",fontsize=10,color="white",style="solid",shape="box"];1006 -> 2903[label="",style="solid", color="burlywood", weight=9];
2903 -> 1020[label="",style="solid", color="burlywood", weight=3];
2904[label="vuz49000/Zero",fontsize=10,color="white",style="solid",shape="box"];1006 -> 2904[label="",style="solid", color="burlywood", weight=9];
2904 -> 1021[label="",style="solid", color="burlywood", weight=3];
1007[label="Integer (Pos Zero) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz50))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];1007 -> 1022[label="",style="solid", color="black", weight=3];
1008[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (primNegInt (Neg (Succ vuz49000))) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];1008 -> 1023[label="",style="solid", color="black", weight=3];
1009[label="Integer (Neg Zero) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz50))) (Integer (Neg Zero))",fontsize=16,color="black",shape="box"];1009 -> 1024[label="",style="solid", color="black", weight=3];
2465[label="Succ (Succ vuz45)",fontsize=16,color="green",shape="box"];2466[label="vuz44",fontsize=16,color="green",shape="box"];2467[label="Succ (Succ vuz45)",fontsize=16,color="green",shape="box"];2468[label="vuz14",fontsize=16,color="green",shape="box"];2464[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz121 (Succ vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS vuz120 (Succ vuz117))))",fontsize=16,color="burlywood",shape="triangle"];2905[label="vuz121/Succ vuz1210",fontsize=10,color="white",style="solid",shape="box"];2464 -> 2905[label="",style="solid", color="burlywood", weight=9];
2905 -> 2479[label="",style="solid", color="burlywood", weight=3];
2906[label="vuz121/Zero",fontsize=10,color="white",style="solid",shape="box"];2464 -> 2906[label="",style="solid", color="burlywood", weight=9];
2906 -> 2480[label="",style="solid", color="burlywood", weight=3];
1032[label="vuz1600",fontsize=16,color="green",shape="box"];1033[label="Zero",fontsize=16,color="green",shape="box"];1398[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz58))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1398 -> 1409[label="",style="solid", color="black", weight=3];
1240[label="Integer vuz520 `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];1240 -> 1271[label="",style="solid", color="black", weight=3];
1036[label="primDivNatS0 vuz3100 vuz3100 (primGEqNatS vuz3100 vuz3100)",fontsize=16,color="burlywood",shape="box"];2907[label="vuz3100/Succ vuz31000",fontsize=10,color="white",style="solid",shape="box"];1036 -> 2907[label="",style="solid", color="burlywood", weight=9];
2907 -> 1054[label="",style="solid", color="burlywood", weight=3];
2908[label="vuz3100/Zero",fontsize=10,color="white",style="solid",shape="box"];1036 -> 2908[label="",style="solid", color="burlywood", weight=9];
2908 -> 1055[label="",style="solid", color="burlywood", weight=3];
2092 -> 1940[label="",style="dashed", color="red", weight=0];
2092[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS vuz920 vuz930))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 (primGEqNatS vuz920 vuz930))))",fontsize=16,color="magenta"];2092 -> 2111[label="",style="dashed", color="magenta", weight=3];
2092 -> 2112[label="",style="dashed", color="magenta", weight=3];
2093[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 True)) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 True)))",fontsize=16,color="black",shape="triangle"];2093 -> 2113[label="",style="solid", color="black", weight=3];
2094[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 False)) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 False)))",fontsize=16,color="black",shape="box"];2094 -> 2114[label="",style="solid", color="black", weight=3];
2095 -> 2093[label="",style="dashed", color="red", weight=0];
2095[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz90) vuz91 True)) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS0 (Succ vuz90) vuz91 True)))",fontsize=16,color="magenta"];1020[label="Integer (Pos (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) vuz50 (primGEqNatS (Succ vuz490000) vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 (Succ vuz490000) vuz50 (primGEqNatS (Succ vuz490000) vuz50))))",fontsize=16,color="burlywood",shape="box"];2911[label="vuz50/Succ vuz500",fontsize=10,color="white",style="solid",shape="box"];1020 -> 2911[label="",style="solid", color="burlywood", weight=9];
2911 -> 1037[label="",style="solid", color="burlywood", weight=3];
2912[label="vuz50/Zero",fontsize=10,color="white",style="solid",shape="box"];1020 -> 2912[label="",style="solid", color="burlywood", weight=9];
2912 -> 1038[label="",style="solid", color="burlywood", weight=3];
1021[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz50 (primGEqNatS Zero vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 Zero vuz50 (primGEqNatS Zero vuz50))))",fontsize=16,color="burlywood",shape="box"];2913[label="vuz50/Succ vuz500",fontsize=10,color="white",style="solid",shape="box"];1021 -> 2913[label="",style="solid", color="burlywood", weight=9];
2913 -> 1039[label="",style="solid", color="burlywood", weight=3];
2914[label="vuz50/Zero",fontsize=10,color="white",style="solid",shape="box"];1021 -> 2914[label="",style="solid", color="burlywood", weight=9];
2914 -> 1040[label="",style="solid", color="burlywood", weight=3];
1022[label="Integer (Pos Zero) `quot` Integer (Pos (Succ vuz50))",fontsize=16,color="black",shape="box"];1022 -> 1041[label="",style="solid", color="black", weight=3];
1023[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (primRemInt (Pos (Succ vuz49000)) (Pos (Succ vuz50))))",fontsize=16,color="black",shape="box"];1023 -> 1042[label="",style="solid", color="black", weight=3];
1024[label="Integer (Neg Zero) `quot` Integer (Pos (Succ vuz50))",fontsize=16,color="black",shape="box"];1024 -> 1043[label="",style="solid", color="black", weight=3];
2479[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1210) (Succ vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS vuz120 (Succ vuz117))))",fontsize=16,color="black",shape="box"];2479 -> 2496[label="",style="solid", color="black", weight=3];
2480[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS vuz120 (Succ vuz117))))",fontsize=16,color="black",shape="box"];2480 -> 2497[label="",style="solid", color="black", weight=3];
1409[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz58))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1409 -> 1447[label="",style="solid", color="black", weight=3];
1271[label="Integer vuz520 `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS Zero (Succ Zero))))",fontsize=16,color="black",shape="box"];1271 -> 1302[label="",style="solid", color="black", weight=3];
1054[label="primDivNatS0 (Succ vuz31000) (Succ vuz31000) (primGEqNatS (Succ vuz31000) (Succ vuz31000))",fontsize=16,color="black",shape="box"];1054 -> 1076[label="",style="solid", color="black", weight=3];
1055[label="primDivNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];1055 -> 1077[label="",style="solid", color="black", weight=3];
2111[label="vuz930",fontsize=16,color="green",shape="box"];2112[label="vuz920",fontsize=16,color="green",shape="box"];2113[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz90) vuz91) (Succ vuz91))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz90) vuz91) (Succ vuz91))))",fontsize=16,color="burlywood",shape="box"];2915[label="vuz91/Succ vuz910",fontsize=10,color="white",style="solid",shape="box"];2113 -> 2915[label="",style="solid", color="burlywood", weight=9];
2915 -> 2146[label="",style="solid", color="burlywood", weight=3];
2916[label="vuz91/Zero",fontsize=10,color="white",style="solid",shape="box"];2113 -> 2916[label="",style="solid", color="burlywood", weight=9];
2916 -> 2147[label="",style="solid", color="burlywood", weight=3];
2114[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz90))) (Pos Zero)) (Integer (Pos (Succ vuz91))) (Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2114 -> 2148[label="",style="solid", color="black", weight=3];
1037[label="Integer (Pos (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS (Succ vuz490000) (Succ vuz500)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS (Succ vuz490000) (Succ vuz500)))))",fontsize=16,color="black",shape="box"];1037 -> 1056[label="",style="solid", color="black", weight=3];
1038[label="Integer (Pos (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) Zero (primGEqNatS (Succ vuz490000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz490000) Zero (primGEqNatS (Succ vuz490000) Zero))))",fontsize=16,color="black",shape="box"];1038 -> 1057[label="",style="solid", color="black", weight=3];
1039[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz500) (primGEqNatS Zero (Succ vuz500)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 Zero (Succ vuz500) (primGEqNatS Zero (Succ vuz500)))))",fontsize=16,color="black",shape="box"];1039 -> 1058[label="",style="solid", color="black", weight=3];
1040[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];1040 -> 1059[label="",style="solid", color="black", weight=3];
1041[label="Integer (primQuotInt (Pos Zero) (Pos (Succ vuz50)))",fontsize=16,color="green",shape="box"];1041 -> 1060[label="",style="dashed", color="green", weight=3];
1042[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz49000) (Succ vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS (Succ vuz49000) (Succ vuz50))))",fontsize=16,color="black",shape="box"];1042 -> 1061[label="",style="solid", color="black", weight=3];
1043[label="Integer (primQuotInt (Neg Zero) (Pos (Succ vuz50)))",fontsize=16,color="green",shape="box"];1043 -> 1062[label="",style="dashed", color="green", weight=3];
2496[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1210 vuz117 (primGEqNatS vuz1210 vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 vuz1210 vuz117 (primGEqNatS vuz1210 vuz117))))",fontsize=16,color="burlywood",shape="box"];2917[label="vuz1210/Succ vuz12100",fontsize=10,color="white",style="solid",shape="box"];2496 -> 2917[label="",style="solid", color="burlywood", weight=9];
2917 -> 2503[label="",style="solid", color="burlywood", weight=3];
2918[label="vuz1210/Zero",fontsize=10,color="white",style="solid",shape="box"];2496 -> 2918[label="",style="solid", color="burlywood", weight=9];
2918 -> 2504[label="",style="solid", color="burlywood", weight=3];
2497[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2497 -> 2505[label="",style="solid", color="black", weight=3];
1447[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz58)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1447 -> 1483[label="",style="solid", color="black", weight=3];
1302[label="Integer vuz520 `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];1302 -> 1324[label="",style="solid", color="black", weight=3];
1076 -> 2705[label="",style="dashed", color="red", weight=0];
1076[label="primDivNatS0 (Succ vuz31000) (Succ vuz31000) (primGEqNatS vuz31000 vuz31000)",fontsize=16,color="magenta"];1076 -> 2706[label="",style="dashed", color="magenta", weight=3];
1076 -> 2707[label="",style="dashed", color="magenta", weight=3];
1076 -> 2708[label="",style="dashed", color="magenta", weight=3];
1076 -> 2709[label="",style="dashed", color="magenta", weight=3];
1077[label="primDivNatS0 Zero Zero True",fontsize=16,color="black",shape="triangle"];1077 -> 1105[label="",style="solid", color="black", weight=3];
2146[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz90) (Succ vuz910)) (Succ (Succ vuz910)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz910)))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz90) (Succ vuz910)) (Succ (Succ vuz910)))))",fontsize=16,color="black",shape="box"];2146 -> 2159[label="",style="solid", color="black", weight=3];
2147[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz90) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz90) Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];2147 -> 2160[label="",style="solid", color="black", weight=3];
2148[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz91))) (Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2148 -> 2161[label="",style="solid", color="black", weight=3];
1056 -> 1940[label="",style="dashed", color="red", weight=0];
1056[label="Integer (Pos (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS vuz490000 vuz500))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS vuz490000 vuz500))))",fontsize=16,color="magenta"];1056 -> 1961[label="",style="dashed", color="magenta", weight=3];
1056 -> 1962[label="",style="dashed", color="magenta", weight=3];
1056 -> 1963[label="",style="dashed", color="magenta", weight=3];
1056 -> 1964[label="",style="dashed", color="magenta", weight=3];
1056 -> 1965[label="",style="dashed", color="magenta", weight=3];
1057 -> 984[label="",style="dashed", color="red", weight=0];
1057[label="Integer (Pos (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz490000) Zero True)))",fontsize=16,color="magenta"];1057 -> 1081[label="",style="dashed", color="magenta", weight=3];
1057 -> 1082[label="",style="dashed", color="magenta", weight=3];
1058[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz500) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 Zero (Succ vuz500) False)))",fontsize=16,color="black",shape="box"];1058 -> 1083[label="",style="solid", color="black", weight=3];
1059 -> 1205[label="",style="dashed", color="red", weight=0];
1059[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];1059 -> 1207[label="",style="dashed", color="magenta", weight=3];
1060[label="primQuotInt (Pos Zero) (Pos (Succ vuz50))",fontsize=16,color="black",shape="box"];1060 -> 1084[label="",style="solid", color="black", weight=3];
1061[label="Integer (Neg (Succ vuz49000)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz49000 vuz50 (primGEqNatS vuz49000 vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 vuz49000 vuz50 (primGEqNatS vuz49000 vuz50))))",fontsize=16,color="burlywood",shape="box"];2923[label="vuz49000/Succ vuz490000",fontsize=10,color="white",style="solid",shape="box"];1061 -> 2923[label="",style="solid", color="burlywood", weight=9];
2923 -> 1085[label="",style="solid", color="burlywood", weight=3];
2924[label="vuz49000/Zero",fontsize=10,color="white",style="solid",shape="box"];1061 -> 2924[label="",style="solid", color="burlywood", weight=9];
2924 -> 1086[label="",style="solid", color="burlywood", weight=3];
1062[label="primQuotInt (Neg Zero) (Pos (Succ vuz50))",fontsize=16,color="black",shape="box"];1062 -> 1087[label="",style="solid", color="black", weight=3];
2503[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz12100) vuz117 (primGEqNatS (Succ vuz12100) vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz12100) vuz117 (primGEqNatS (Succ vuz12100) vuz117))))",fontsize=16,color="burlywood",shape="box"];2925[label="vuz117/Succ vuz1170",fontsize=10,color="white",style="solid",shape="box"];2503 -> 2925[label="",style="solid", color="burlywood", weight=9];
2925 -> 2514[label="",style="solid", color="burlywood", weight=3];
2926[label="vuz117/Zero",fontsize=10,color="white",style="solid",shape="box"];2503 -> 2926[label="",style="solid", color="burlywood", weight=9];
2926 -> 2515[label="",style="solid", color="burlywood", weight=3];
2504[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz117 (primGEqNatS Zero vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 Zero vuz117 (primGEqNatS Zero vuz117))))",fontsize=16,color="burlywood",shape="box"];2927[label="vuz117/Succ vuz1170",fontsize=10,color="white",style="solid",shape="box"];2504 -> 2927[label="",style="solid", color="burlywood", weight=9];
2927 -> 2516[label="",style="solid", color="burlywood", weight=3];
2928[label="vuz117/Zero",fontsize=10,color="white",style="solid",shape="box"];2504 -> 2928[label="",style="solid", color="burlywood", weight=9];
2928 -> 2517[label="",style="solid", color="burlywood", weight=3];
2505[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 True (Integer (Pos (Succ vuz117))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2505 -> 2518[label="",style="solid", color="black", weight=3];
1483[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz58)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1483 -> 1522[label="",style="solid", color="black", weight=3];
1324[label="Integer vuz520 `quot` gcd0Gcd'1 True (Integer (Pos (Succ Zero))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];1324 -> 1359[label="",style="solid", color="black", weight=3];
2706[label="vuz31000",fontsize=16,color="green",shape="box"];2707[label="vuz31000",fontsize=16,color="green",shape="box"];2708[label="vuz31000",fontsize=16,color="green",shape="box"];2709[label="vuz31000",fontsize=16,color="green",shape="box"];2705[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS vuz137 vuz138)",fontsize=16,color="burlywood",shape="triangle"];2929[label="vuz137/Succ vuz1370",fontsize=10,color="white",style="solid",shape="box"];2705 -> 2929[label="",style="solid", color="burlywood", weight=9];
2929 -> 2770[label="",style="solid", color="burlywood", weight=3];
2930[label="vuz137/Zero",fontsize=10,color="white",style="solid",shape="box"];2705 -> 2930[label="",style="solid", color="burlywood", weight=9];
2930 -> 2771[label="",style="solid", color="burlywood", weight=3];
1105[label="Succ (primDivNatS (primMinusNatS Zero Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1105 -> 1131[label="",style="dashed", color="green", weight=3];
2159[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS vuz90 vuz910) (Succ (Succ vuz910)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz910)))) (Integer (Pos (primModNatS (primMinusNatS vuz90 vuz910) (Succ (Succ vuz910)))))",fontsize=16,color="burlywood",shape="box"];2931[label="vuz90/Succ vuz900",fontsize=10,color="white",style="solid",shape="box"];2159 -> 2931[label="",style="solid", color="burlywood", weight=9];
2931 -> 2194[label="",style="solid", color="burlywood", weight=3];
2932[label="vuz90/Zero",fontsize=10,color="white",style="solid",shape="box"];2159 -> 2932[label="",style="solid", color="burlywood", weight=9];
2932 -> 2195[label="",style="solid", color="burlywood", weight=3];
2160 -> 1015[label="",style="dashed", color="red", weight=0];
2160[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz90) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz90) (Succ Zero))))",fontsize=16,color="magenta"];2160 -> 2196[label="",style="dashed", color="magenta", weight=3];
2160 -> 2197[label="",style="dashed", color="magenta", weight=3];
2161[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz91))) (Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2161 -> 2198[label="",style="solid", color="black", weight=3];
1961[label="vuz490000",fontsize=16,color="green",shape="box"];1962[label="vuz500",fontsize=16,color="green",shape="box"];1963[label="vuz490000",fontsize=16,color="green",shape="box"];1964[label="Succ vuz500",fontsize=16,color="green",shape="box"];1965[label="vuz490000",fontsize=16,color="green",shape="box"];1081[label="vuz490000",fontsize=16,color="green",shape="box"];1082[label="vuz490000",fontsize=16,color="green",shape="box"];984[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz47) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz47) Zero True)))",fontsize=16,color="black",shape="triangle"];984 -> 998[label="",style="solid", color="black", weight=3];
1083[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1083 -> 1106[label="",style="solid", color="black", weight=3];
1207[label="Integer (Pos (Succ Zero))",fontsize=16,color="green",shape="box"];1084[label="Pos (primDivNatS Zero (Succ vuz50))",fontsize=16,color="green",shape="box"];1084 -> 1107[label="",style="dashed", color="green", weight=3];
1085[label="Integer (Neg (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) vuz50 (primGEqNatS (Succ vuz490000) vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 (Succ vuz490000) vuz50 (primGEqNatS (Succ vuz490000) vuz50))))",fontsize=16,color="burlywood",shape="box"];2934[label="vuz50/Succ vuz500",fontsize=10,color="white",style="solid",shape="box"];1085 -> 2934[label="",style="solid", color="burlywood", weight=9];
2934 -> 1108[label="",style="solid", color="burlywood", weight=3];
2935[label="vuz50/Zero",fontsize=10,color="white",style="solid",shape="box"];1085 -> 2935[label="",style="solid", color="burlywood", weight=9];
2935 -> 1109[label="",style="solid", color="burlywood", weight=3];
1086[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero vuz50 (primGEqNatS Zero vuz50))) (Pos Zero)) (Integer (Pos (Succ vuz50))) (Integer (Pos (primModNatS0 Zero vuz50 (primGEqNatS Zero vuz50))))",fontsize=16,color="burlywood",shape="box"];2936[label="vuz50/Succ vuz500",fontsize=10,color="white",style="solid",shape="box"];1086 -> 2936[label="",style="solid", color="burlywood", weight=9];
2936 -> 1110[label="",style="solid", color="burlywood", weight=3];
2937[label="vuz50/Zero",fontsize=10,color="white",style="solid",shape="box"];1086 -> 2937[label="",style="solid", color="burlywood", weight=9];
2937 -> 1111[label="",style="solid", color="burlywood", weight=3];
1087[label="Neg (primDivNatS Zero (Succ vuz50))",fontsize=16,color="green",shape="box"];1087 -> 1112[label="",style="dashed", color="green", weight=3];
2514[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz12100) (Succ vuz1170) (primGEqNatS (Succ vuz12100) (Succ vuz1170)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (primModNatS0 (Succ vuz12100) (Succ vuz1170) (primGEqNatS (Succ vuz12100) (Succ vuz1170)))))",fontsize=16,color="black",shape="box"];2514 -> 2524[label="",style="solid", color="black", weight=3];
2515[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz12100) Zero (primGEqNatS (Succ vuz12100) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz12100) Zero (primGEqNatS (Succ vuz12100) Zero))))",fontsize=16,color="black",shape="box"];2515 -> 2525[label="",style="solid", color="black", weight=3];
2516[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1170) (primGEqNatS Zero (Succ vuz1170)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1170) (primGEqNatS Zero (Succ vuz1170)))))",fontsize=16,color="black",shape="box"];2516 -> 2526[label="",style="solid", color="black", weight=3];
2517[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2517 -> 2527[label="",style="solid", color="black", weight=3];
2518[label="Integer (Neg (Succ (Succ vuz115))) `quot` Integer (Pos (Succ vuz117))",fontsize=16,color="black",shape="box"];2518 -> 2528[label="",style="solid", color="black", weight=3];
1522[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz58)) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ vuz58)) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1522 -> 1560[label="",style="solid", color="black", weight=3];
1359[label="Integer vuz520 `quot` Integer (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1359 -> 1399[label="",style="solid", color="black", weight=3];
2770[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS (Succ vuz1370) vuz138)",fontsize=16,color="burlywood",shape="box"];2938[label="vuz138/Succ vuz1380",fontsize=10,color="white",style="solid",shape="box"];2770 -> 2938[label="",style="solid", color="burlywood", weight=9];
2938 -> 2772[label="",style="solid", color="burlywood", weight=3];
2939[label="vuz138/Zero",fontsize=10,color="white",style="solid",shape="box"];2770 -> 2939[label="",style="solid", color="burlywood", weight=9];
2939 -> 2773[label="",style="solid", color="burlywood", weight=3];
2771[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS Zero vuz138)",fontsize=16,color="burlywood",shape="box"];2940[label="vuz138/Succ vuz1380",fontsize=10,color="white",style="solid",shape="box"];2771 -> 2940[label="",style="solid", color="burlywood", weight=9];
2940 -> 2774[label="",style="solid", color="burlywood", weight=3];
2941[label="vuz138/Zero",fontsize=10,color="white",style="solid",shape="box"];2771 -> 2941[label="",style="solid", color="burlywood", weight=9];
2941 -> 2775[label="",style="solid", color="burlywood", weight=3];
1131 -> 2250[label="",style="dashed", color="red", weight=0];
1131[label="primDivNatS (primMinusNatS Zero Zero) (Succ Zero)",fontsize=16,color="magenta"];1131 -> 2251[label="",style="dashed", color="magenta", weight=3];
1131 -> 2252[label="",style="dashed", color="magenta", weight=3];
2194[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz900) vuz910) (Succ (Succ vuz910)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz910)))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz900) vuz910) (Succ (Succ vuz910)))))",fontsize=16,color="burlywood",shape="box"];2943[label="vuz910/Succ vuz9100",fontsize=10,color="white",style="solid",shape="box"];2194 -> 2943[label="",style="solid", color="burlywood", weight=9];
2943 -> 2233[label="",style="solid", color="burlywood", weight=3];
2944[label="vuz910/Zero",fontsize=10,color="white",style="solid",shape="box"];2194 -> 2944[label="",style="solid", color="burlywood", weight=9];
2944 -> 2234[label="",style="solid", color="burlywood", weight=3];
2195[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero vuz910) (Succ (Succ vuz910)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz910)))) (Integer (Pos (primModNatS (primMinusNatS Zero vuz910) (Succ (Succ vuz910)))))",fontsize=16,color="burlywood",shape="box"];2945[label="vuz910/Succ vuz9100",fontsize=10,color="white",style="solid",shape="box"];2195 -> 2945[label="",style="solid", color="burlywood", weight=9];
2945 -> 2235[label="",style="solid", color="burlywood", weight=3];
2946[label="vuz910/Zero",fontsize=10,color="white",style="solid",shape="box"];2195 -> 2946[label="",style="solid", color="burlywood", weight=9];
2946 -> 2236[label="",style="solid", color="burlywood", weight=3];
2196[label="vuz90",fontsize=16,color="green",shape="box"];2197[label="vuz89",fontsize=16,color="green",shape="box"];1015[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz47) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz47) (Succ Zero))))",fontsize=16,color="black",shape="triangle"];1015 -> 1031[label="",style="solid", color="black", weight=3];
2198[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (Succ vuz91)) `rem` Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2198 -> 2237[label="",style="solid", color="black", weight=3];
998[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz47) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz47) Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];998 -> 1015[label="",style="solid", color="black", weight=3];
1106[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1106 -> 1132[label="",style="solid", color="black", weight=3];
1107[label="primDivNatS Zero (Succ vuz50)",fontsize=16,color="black",shape="triangle"];1107 -> 1133[label="",style="solid", color="black", weight=3];
1108[label="Integer (Neg (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS (Succ vuz490000) (Succ vuz500)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS (Succ vuz490000) (Succ vuz500)))))",fontsize=16,color="black",shape="box"];1108 -> 1134[label="",style="solid", color="black", weight=3];
1109[label="Integer (Neg (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) Zero (primGEqNatS (Succ vuz490000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz490000) Zero (primGEqNatS (Succ vuz490000) Zero))))",fontsize=16,color="black",shape="box"];1109 -> 1135[label="",style="solid", color="black", weight=3];
1110[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz500) (primGEqNatS Zero (Succ vuz500)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 Zero (Succ vuz500) (primGEqNatS Zero (Succ vuz500)))))",fontsize=16,color="black",shape="box"];1110 -> 1136[label="",style="solid", color="black", weight=3];
1111[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];1111 -> 1137[label="",style="solid", color="black", weight=3];
1112 -> 1107[label="",style="dashed", color="red", weight=0];
1112[label="primDivNatS Zero (Succ vuz50)",fontsize=16,color="magenta"];2524 -> 2325[label="",style="dashed", color="red", weight=0];
2524[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz12100) (Succ vuz1170) (primGEqNatS vuz12100 vuz1170))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (primModNatS0 (Succ vuz12100) (Succ vuz1170) (primGEqNatS vuz12100 vuz1170))))",fontsize=16,color="magenta"];2524 -> 2533[label="",style="dashed", color="magenta", weight=3];
2524 -> 2534[label="",style="dashed", color="magenta", weight=3];
2524 -> 2535[label="",style="dashed", color="magenta", weight=3];
2524 -> 2536[label="",style="dashed", color="magenta", weight=3];
2525 -> 2437[label="",style="dashed", color="red", weight=0];
2525[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz12100) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz12100) Zero True)))",fontsize=16,color="magenta"];2525 -> 2537[label="",style="dashed", color="magenta", weight=3];
2525 -> 2538[label="",style="dashed", color="magenta", weight=3];
2526[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz1170) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (primModNatS0 Zero (Succ vuz1170) False)))",fontsize=16,color="black",shape="box"];2526 -> 2539[label="",style="solid", color="black", weight=3];
2527 -> 1205[label="",style="dashed", color="red", weight=0];
2527[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];2527 -> 2540[label="",style="dashed", color="magenta", weight=3];
2528[label="Integer (primQuotInt (Neg (Succ (Succ vuz115))) (Pos (Succ vuz117)))",fontsize=16,color="green",shape="box"];2528 -> 2541[label="",style="dashed", color="green", weight=3];
1560[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1560 -> 1586[label="",style="solid", color="black", weight=3];
1399[label="Integer (primQuotInt vuz520 (Pos (Succ Zero)))",fontsize=16,color="green",shape="box"];1399 -> 1410[label="",style="dashed", color="green", weight=3];
2772[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS (Succ vuz1370) (Succ vuz1380))",fontsize=16,color="black",shape="box"];2772 -> 2776[label="",style="solid", color="black", weight=3];
2773[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS (Succ vuz1370) Zero)",fontsize=16,color="black",shape="box"];2773 -> 2777[label="",style="solid", color="black", weight=3];
2774[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS Zero (Succ vuz1380))",fontsize=16,color="black",shape="box"];2774 -> 2778[label="",style="solid", color="black", weight=3];
2775[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];2775 -> 2779[label="",style="solid", color="black", weight=3];
2251[label="Zero",fontsize=16,color="green",shape="box"];2252[label="Zero",fontsize=16,color="green",shape="box"];2250[label="primDivNatS (primMinusNatS vuz107 vuz107) (Succ vuz108)",fontsize=16,color="burlywood",shape="triangle"];2951[label="vuz107/Succ vuz1070",fontsize=10,color="white",style="solid",shape="box"];2250 -> 2951[label="",style="solid", color="burlywood", weight=9];
2951 -> 2271[label="",style="solid", color="burlywood", weight=3];
2952[label="vuz107/Zero",fontsize=10,color="white",style="solid",shape="box"];2250 -> 2952[label="",style="solid", color="burlywood", weight=9];
2952 -> 2272[label="",style="solid", color="burlywood", weight=3];
2233[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz900) (Succ vuz9100)) (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz900) (Succ vuz9100)) (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2233 -> 2273[label="",style="solid", color="black", weight=3];
2234[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz900) Zero) (Succ (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz900) Zero) (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];2234 -> 2274[label="",style="solid", color="black", weight=3];
2235[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero (Succ vuz9100)) (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS (primMinusNatS Zero (Succ vuz9100)) (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2235 -> 2275[label="",style="solid", color="black", weight=3];
2236[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS Zero Zero) (Succ (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS (primMinusNatS Zero Zero) (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];2236 -> 2276[label="",style="solid", color="black", weight=3];
1031[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz47 Zero (primGEqNatS vuz47 Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 vuz47 Zero (primGEqNatS vuz47 Zero))))",fontsize=16,color="burlywood",shape="box"];2953[label="vuz47/Succ vuz470",fontsize=10,color="white",style="solid",shape="box"];1031 -> 2953[label="",style="solid", color="burlywood", weight=9];
2953 -> 1051[label="",style="solid", color="burlywood", weight=3];
2954[label="vuz47/Zero",fontsize=10,color="white",style="solid",shape="box"];1031 -> 2954[label="",style="solid", color="burlywood", weight=9];
2954 -> 1052[label="",style="solid", color="burlywood", weight=3];
2237[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (Succ vuz91)) `rem` Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2237 -> 2277[label="",style="solid", color="black", weight=3];
1132[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1132 -> 1161[label="",style="solid", color="black", weight=3];
1133[label="Zero",fontsize=16,color="green",shape="box"];1134 -> 2325[label="",style="dashed", color="red", weight=0];
1134[label="Integer (Neg (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS vuz490000 vuz500))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 (Succ vuz490000) (Succ vuz500) (primGEqNatS vuz490000 vuz500))))",fontsize=16,color="magenta"];1134 -> 2341[label="",style="dashed", color="magenta", weight=3];
1134 -> 2342[label="",style="dashed", color="magenta", weight=3];
1134 -> 2343[label="",style="dashed", color="magenta", weight=3];
1134 -> 2344[label="",style="dashed", color="magenta", weight=3];
1134 -> 2345[label="",style="dashed", color="magenta", weight=3];
1135 -> 1045[label="",style="dashed", color="red", weight=0];
1135[label="Integer (Neg (Succ (Succ vuz490000))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz490000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz490000) Zero True)))",fontsize=16,color="magenta"];1135 -> 1165[label="",style="dashed", color="magenta", weight=3];
1135 -> 1166[label="",style="dashed", color="magenta", weight=3];
1136[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz500) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (primModNatS0 Zero (Succ vuz500) False)))",fontsize=16,color="black",shape="box"];1136 -> 1167[label="",style="solid", color="black", weight=3];
1137 -> 1205[label="",style="dashed", color="red", weight=0];
1137[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];1137 -> 1209[label="",style="dashed", color="magenta", weight=3];
2533[label="vuz12100",fontsize=16,color="green",shape="box"];2534[label="vuz1170",fontsize=16,color="green",shape="box"];2535[label="Succ vuz1170",fontsize=16,color="green",shape="box"];2536[label="vuz12100",fontsize=16,color="green",shape="box"];2325[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS vuz118 vuz119))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS vuz118 vuz119))))",fontsize=16,color="burlywood",shape="triangle"];2958[label="vuz118/Succ vuz1180",fontsize=10,color="white",style="solid",shape="box"];2325 -> 2958[label="",style="solid", color="burlywood", weight=9];
2958 -> 2411[label="",style="solid", color="burlywood", weight=3];
2959[label="vuz118/Zero",fontsize=10,color="white",style="solid",shape="box"];2325 -> 2959[label="",style="solid", color="burlywood", weight=9];
2959 -> 2412[label="",style="solid", color="burlywood", weight=3];
2537[label="Zero",fontsize=16,color="green",shape="box"];2538[label="vuz12100",fontsize=16,color="green",shape="box"];2437[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 True)) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 True)))",fontsize=16,color="black",shape="triangle"];2437 -> 2452[label="",style="solid", color="black", weight=3];
2539[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2539 -> 2547[label="",style="solid", color="black", weight=3];
2540[label="Integer (Neg (Succ (Succ vuz115)))",fontsize=16,color="green",shape="box"];2541[label="primQuotInt (Neg (Succ (Succ vuz115))) (Pos (Succ vuz117))",fontsize=16,color="black",shape="box"];2541 -> 2548[label="",style="solid", color="black", weight=3];
1586[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1586 -> 1626[label="",style="solid", color="black", weight=3];
1410[label="primQuotInt vuz520 (Pos (Succ Zero))",fontsize=16,color="burlywood",shape="box"];2960[label="vuz520/Pos vuz5200",fontsize=10,color="white",style="solid",shape="box"];1410 -> 2960[label="",style="solid", color="burlywood", weight=9];
2960 -> 1449[label="",style="solid", color="burlywood", weight=3];
2961[label="vuz520/Neg vuz5200",fontsize=10,color="white",style="solid",shape="box"];1410 -> 2961[label="",style="solid", color="burlywood", weight=9];
2961 -> 1450[label="",style="solid", color="burlywood", weight=3];
2776 -> 2705[label="",style="dashed", color="red", weight=0];
2776[label="primDivNatS0 (Succ vuz135) (Succ vuz136) (primGEqNatS vuz1370 vuz1380)",fontsize=16,color="magenta"];2776 -> 2780[label="",style="dashed", color="magenta", weight=3];
2776 -> 2781[label="",style="dashed", color="magenta", weight=3];
2777[label="primDivNatS0 (Succ vuz135) (Succ vuz136) True",fontsize=16,color="black",shape="triangle"];2777 -> 2782[label="",style="solid", color="black", weight=3];
2778[label="primDivNatS0 (Succ vuz135) (Succ vuz136) False",fontsize=16,color="black",shape="box"];2778 -> 2783[label="",style="solid", color="black", weight=3];
2779 -> 2777[label="",style="dashed", color="red", weight=0];
2779[label="primDivNatS0 (Succ vuz135) (Succ vuz136) True",fontsize=16,color="magenta"];2271[label="primDivNatS (primMinusNatS (Succ vuz1070) (Succ vuz1070)) (Succ vuz108)",fontsize=16,color="black",shape="box"];2271 -> 2298[label="",style="solid", color="black", weight=3];
2272[label="primDivNatS (primMinusNatS Zero Zero) (Succ vuz108)",fontsize=16,color="black",shape="box"];2272 -> 2299[label="",style="solid", color="black", weight=3];
2273 -> 2300[label="",style="dashed", color="red", weight=0];
2273[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS vuz900 vuz9100) (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS (primMinusNatS vuz900 vuz9100) (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="magenta"];2273 -> 2301[label="",style="dashed", color="magenta", weight=3];
2273 -> 2302[label="",style="dashed", color="magenta", weight=3];
2274[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz900) (Succ (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS (Succ vuz900) (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];2274 -> 2305[label="",style="solid", color="black", weight=3];
2275 -> 2300[label="",style="dashed", color="red", weight=0];
2275[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS Zero (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="magenta"];2275 -> 2303[label="",style="dashed", color="magenta", weight=3];
2275 -> 2304[label="",style="dashed", color="magenta", weight=3];
2276[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS Zero (Succ (Succ Zero)))))",fontsize=16,color="black",shape="box"];2276 -> 2306[label="",style="solid", color="black", weight=3];
1051[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz470) Zero (primGEqNatS (Succ vuz470) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz470) Zero (primGEqNatS (Succ vuz470) Zero))))",fontsize=16,color="black",shape="box"];1051 -> 1073[label="",style="solid", color="black", weight=3];
1052[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];1052 -> 1074[label="",style="solid", color="black", weight=3];
2277[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz91)) `rem` Integer (Pos (Succ (Succ vuz90))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (Succ vuz91)) `rem` Integer (Pos (Succ (Succ vuz90))))",fontsize=16,color="black",shape="box"];2277 -> 2307[label="",style="solid", color="black", weight=3];
1161[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1161 -> 1194[label="",style="solid", color="black", weight=3];
2341[label="vuz490000",fontsize=16,color="green",shape="box"];2342[label="vuz490000",fontsize=16,color="green",shape="box"];2343[label="vuz500",fontsize=16,color="green",shape="box"];2344[label="Succ vuz500",fontsize=16,color="green",shape="box"];2345[label="vuz490000",fontsize=16,color="green",shape="box"];1165[label="vuz490000",fontsize=16,color="green",shape="box"];1166[label="vuz490000",fontsize=16,color="green",shape="box"];1045[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz45) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz45) Zero True)))",fontsize=16,color="black",shape="triangle"];1045 -> 1065[label="",style="solid", color="black", weight=3];
1167[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1167 -> 1195[label="",style="solid", color="black", weight=3];
1209[label="Integer (Neg (Succ Zero))",fontsize=16,color="green",shape="box"];2411[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) vuz119))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) vuz119))))",fontsize=16,color="burlywood",shape="box"];2966[label="vuz119/Succ vuz1190",fontsize=10,color="white",style="solid",shape="box"];2411 -> 2966[label="",style="solid", color="burlywood", weight=9];
2966 -> 2423[label="",style="solid", color="burlywood", weight=3];
2967[label="vuz119/Zero",fontsize=10,color="white",style="solid",shape="box"];2411 -> 2967[label="",style="solid", color="burlywood", weight=9];
2967 -> 2424[label="",style="solid", color="burlywood", weight=3];
2412[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero vuz119))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero vuz119))))",fontsize=16,color="burlywood",shape="box"];2968[label="vuz119/Succ vuz1190",fontsize=10,color="white",style="solid",shape="box"];2412 -> 2968[label="",style="solid", color="burlywood", weight=9];
2968 -> 2425[label="",style="solid", color="burlywood", weight=3];
2969[label="vuz119/Zero",fontsize=10,color="white",style="solid",shape="box"];2412 -> 2969[label="",style="solid", color="burlywood", weight=9];
2969 -> 2426[label="",style="solid", color="burlywood", weight=3];
2452 -> 2464[label="",style="dashed", color="red", weight=0];
2452[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz116) vuz117) (Succ vuz117))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz116) vuz117) (Succ vuz117))))",fontsize=16,color="magenta"];2452 -> 2469[label="",style="dashed", color="magenta", weight=3];
2452 -> 2470[label="",style="dashed", color="magenta", weight=3];
2547[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2547 -> 2554[label="",style="solid", color="black", weight=3];
2548[label="Neg (primDivNatS (Succ (Succ vuz115)) (Succ vuz117))",fontsize=16,color="green",shape="box"];2548 -> 2555[label="",style="dashed", color="green", weight=3];
1626[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ vuz58)) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1626 -> 1664[label="",style="solid", color="black", weight=3];
1449[label="primQuotInt (Pos vuz5200) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1449 -> 1485[label="",style="solid", color="black", weight=3];
1450[label="primQuotInt (Neg vuz5200) (Pos (Succ Zero))",fontsize=16,color="black",shape="box"];1450 -> 1486[label="",style="solid", color="black", weight=3];
2780[label="vuz1370",fontsize=16,color="green",shape="box"];2781[label="vuz1380",fontsize=16,color="green",shape="box"];2782[label="Succ (primDivNatS (primMinusNatS (Succ vuz135) (Succ vuz136)) (Succ (Succ vuz136)))",fontsize=16,color="green",shape="box"];2782 -> 2784[label="",style="dashed", color="green", weight=3];
2783[label="Zero",fontsize=16,color="green",shape="box"];2298 -> 2250[label="",style="dashed", color="red", weight=0];
2298[label="primDivNatS (primMinusNatS vuz1070 vuz1070) (Succ vuz108)",fontsize=16,color="magenta"];2298 -> 2308[label="",style="dashed", color="magenta", weight=3];
2299 -> 1107[label="",style="dashed", color="red", weight=0];
2299[label="primDivNatS Zero (Succ vuz108)",fontsize=16,color="magenta"];2299 -> 2309[label="",style="dashed", color="magenta", weight=3];
2301 -> 2238[label="",style="dashed", color="red", weight=0];
2301[label="primMinusNatS vuz900 vuz9100",fontsize=16,color="magenta"];2301 -> 2310[label="",style="dashed", color="magenta", weight=3];
2301 -> 2311[label="",style="dashed", color="magenta", weight=3];
2302 -> 2238[label="",style="dashed", color="red", weight=0];
2302[label="primMinusNatS vuz900 vuz9100",fontsize=16,color="magenta"];2302 -> 2312[label="",style="dashed", color="magenta", weight=3];
2302 -> 2313[label="",style="dashed", color="magenta", weight=3];
2300[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS vuz113 (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS vuz112 (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="burlywood",shape="triangle"];2975[label="vuz113/Succ vuz1130",fontsize=10,color="white",style="solid",shape="box"];2300 -> 2975[label="",style="solid", color="burlywood", weight=9];
2975 -> 2314[label="",style="solid", color="burlywood", weight=3];
2976[label="vuz113/Zero",fontsize=10,color="white",style="solid",shape="box"];2300 -> 2976[label="",style="solid", color="burlywood", weight=9];
2976 -> 2315[label="",style="solid", color="burlywood", weight=3];
2305[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz900 (Succ Zero) (primGEqNatS vuz900 (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS0 vuz900 (Succ Zero) (primGEqNatS vuz900 (Succ Zero)))))",fontsize=16,color="burlywood",shape="box"];2977[label="vuz900/Succ vuz9000",fontsize=10,color="white",style="solid",shape="box"];2305 -> 2977[label="",style="solid", color="burlywood", weight=9];
2977 -> 2413[label="",style="solid", color="burlywood", weight=3];
2978[label="vuz900/Zero",fontsize=10,color="white",style="solid",shape="box"];2305 -> 2978[label="",style="solid", color="burlywood", weight=9];
2978 -> 2414[label="",style="solid", color="burlywood", weight=3];
2303[label="Zero",fontsize=16,color="green",shape="box"];2304[label="Zero",fontsize=16,color="green",shape="box"];2306[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2306 -> 2415[label="",style="solid", color="black", weight=3];
1073 -> 984[label="",style="dashed", color="red", weight=0];
1073[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz470) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz470) Zero True)))",fontsize=16,color="magenta"];1073 -> 1100[label="",style="dashed", color="magenta", weight=3];
1074 -> 1205[label="",style="dashed", color="red", weight=0];
1074[label="Integer (Pos (Succ (Succ vuz46))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];1074 -> 1208[label="",style="dashed", color="magenta", weight=3];
2307[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2307 -> 2416[label="",style="solid", color="black", weight=3];
1194[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1194 -> 1230[label="",style="solid", color="black", weight=3];
1065 -> 2464[label="",style="dashed", color="red", weight=0];
1065[label="Integer (Neg (Succ (Succ vuz44))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz45) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz45) Zero) (Succ Zero))))",fontsize=16,color="magenta"];1065 -> 2471[label="",style="dashed", color="magenta", weight=3];
1065 -> 2472[label="",style="dashed", color="magenta", weight=3];
1065 -> 2473[label="",style="dashed", color="magenta", weight=3];
1065 -> 2474[label="",style="dashed", color="magenta", weight=3];
1195[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 False (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1195 -> 1231[label="",style="solid", color="black", weight=3];
2423[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) (Succ vuz1190)))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) (Succ vuz1190)))))",fontsize=16,color="black",shape="box"];2423 -> 2436[label="",style="solid", color="black", weight=3];
2424[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) Zero))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS (Succ vuz1180) Zero))))",fontsize=16,color="black",shape="box"];2424 -> 2437[label="",style="solid", color="black", weight=3];
2425[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero (Succ vuz1190)))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero (Succ vuz1190)))))",fontsize=16,color="black",shape="box"];2425 -> 2438[label="",style="solid", color="black", weight=3];
2426[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];2426 -> 2439[label="",style="solid", color="black", weight=3];
2469 -> 2238[label="",style="dashed", color="red", weight=0];
2469[label="primMinusNatS (Succ vuz116) vuz117",fontsize=16,color="magenta"];2469 -> 2489[label="",style="dashed", color="magenta", weight=3];
2469 -> 2490[label="",style="dashed", color="magenta", weight=3];
2470 -> 2238[label="",style="dashed", color="red", weight=0];
2470[label="primMinusNatS (Succ vuz116) vuz117",fontsize=16,color="magenta"];2470 -> 2491[label="",style="dashed", color="magenta", weight=3];
2470 -> 2492[label="",style="dashed", color="magenta", weight=3];
2554[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz1170)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2554 -> 2561[label="",style="solid", color="black", weight=3];
2555[label="primDivNatS (Succ (Succ vuz115)) (Succ vuz117)",fontsize=16,color="black",shape="box"];2555 -> 2562[label="",style="solid", color="black", weight=3];
1664 -> 1015[label="",style="dashed", color="red", weight=0];
1664[label="Integer (Pos (Succ (Succ vuz57))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz58) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz58) (Succ Zero))))",fontsize=16,color="magenta"];1664 -> 1696[label="",style="dashed", color="magenta", weight=3];
1664 -> 1697[label="",style="dashed", color="magenta", weight=3];
1485[label="Pos (primDivNatS vuz5200 (Succ Zero))",fontsize=16,color="green",shape="box"];1485 -> 1524[label="",style="dashed", color="green", weight=3];
1486[label="Neg (primDivNatS vuz5200 (Succ Zero))",fontsize=16,color="green",shape="box"];1486 -> 1525[label="",style="dashed", color="green", weight=3];
2784 -> 2785[label="",style="dashed", color="red", weight=0];
2784[label="primDivNatS (primMinusNatS (Succ vuz135) (Succ vuz136)) (Succ (Succ vuz136))",fontsize=16,color="magenta"];2784 -> 2786[label="",style="dashed", color="magenta", weight=3];
2308[label="vuz1070",fontsize=16,color="green",shape="box"];2309[label="vuz108",fontsize=16,color="green",shape="box"];2310[label="vuz9100",fontsize=16,color="green",shape="box"];2311[label="vuz900",fontsize=16,color="green",shape="box"];2238[label="primMinusNatS vuz1020 vuz103",fontsize=16,color="burlywood",shape="triangle"];2986[label="vuz1020/Succ vuz10200",fontsize=10,color="white",style="solid",shape="box"];2238 -> 2986[label="",style="solid", color="burlywood", weight=9];
2986 -> 2278[label="",style="solid", color="burlywood", weight=3];
2987[label="vuz1020/Zero",fontsize=10,color="white",style="solid",shape="box"];2238 -> 2987[label="",style="solid", color="burlywood", weight=9];
2987 -> 2279[label="",style="solid", color="burlywood", weight=3];
2312[label="vuz9100",fontsize=16,color="green",shape="box"];2313[label="vuz900",fontsize=16,color="green",shape="box"];2314[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz1130) (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS vuz112 (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2314 -> 2417[label="",style="solid", color="black", weight=3];
2315[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS Zero (Succ (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS vuz112 (Succ (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2315 -> 2418[label="",style="solid", color="black", weight=3];
2413[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz9000) (Succ Zero) (primGEqNatS (Succ vuz9000) (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS0 (Succ vuz9000) (Succ Zero) (primGEqNatS (Succ vuz9000) (Succ Zero)))))",fontsize=16,color="black",shape="box"];2413 -> 2427[label="",style="solid", color="black", weight=3];
2414[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ Zero) (primGEqNatS Zero (Succ Zero)))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS0 Zero (Succ Zero) (primGEqNatS Zero (Succ Zero)))))",fontsize=16,color="black",shape="box"];2414 -> 2428[label="",style="solid", color="black", weight=3];
2415[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 True (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2415 -> 2429[label="",style="solid", color="black", weight=3];
1100[label="vuz470",fontsize=16,color="green",shape="box"];1208[label="Integer (Pos (Succ (Succ vuz46)))",fontsize=16,color="green",shape="box"];2416[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2416 -> 2430[label="",style="solid", color="black", weight=3];
1230 -> 901[label="",style="dashed", color="red", weight=0];
1230[label="Integer (Pos (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];1230 -> 1257[label="",style="dashed", color="magenta", weight=3];
1230 -> 1258[label="",style="dashed", color="magenta", weight=3];
2471 -> 2238[label="",style="dashed", color="red", weight=0];
2471[label="primMinusNatS (Succ vuz45) Zero",fontsize=16,color="magenta"];2471 -> 2481[label="",style="dashed", color="magenta", weight=3];
2471 -> 2482[label="",style="dashed", color="magenta", weight=3];
2472[label="vuz44",fontsize=16,color="green",shape="box"];2473 -> 2238[label="",style="dashed", color="red", weight=0];
2473[label="primMinusNatS (Succ vuz45) Zero",fontsize=16,color="magenta"];2473 -> 2483[label="",style="dashed", color="magenta", weight=3];
2473 -> 2484[label="",style="dashed", color="magenta", weight=3];
2474[label="Zero",fontsize=16,color="green",shape="box"];1231[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'0 (Integer (Pos (Succ (Succ vuz500)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1231 -> 1259[label="",style="solid", color="black", weight=3];
2436 -> 2325[label="",style="dashed", color="red", weight=0];
2436[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS vuz1180 vuz1190))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 (primGEqNatS vuz1180 vuz1190))))",fontsize=16,color="magenta"];2436 -> 2450[label="",style="dashed", color="magenta", weight=3];
2436 -> 2451[label="",style="dashed", color="magenta", weight=3];
2438[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 False)) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 False)))",fontsize=16,color="black",shape="box"];2438 -> 2453[label="",style="solid", color="black", weight=3];
2439 -> 2437[label="",style="dashed", color="red", weight=0];
2439[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz116) vuz117 True)) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (primModNatS0 (Succ vuz116) vuz117 True)))",fontsize=16,color="magenta"];2489[label="vuz117",fontsize=16,color="green",shape="box"];2490[label="Succ vuz116",fontsize=16,color="green",shape="box"];2491[label="vuz117",fontsize=16,color="green",shape="box"];2492[label="Succ vuz116",fontsize=16,color="green",shape="box"];2561[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1170))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2561 -> 2567[label="",style="solid", color="black", weight=3];
2562[label="primDivNatS0 (Succ vuz115) vuz117 (primGEqNatS (Succ vuz115) vuz117)",fontsize=16,color="burlywood",shape="box"];2993[label="vuz117/Succ vuz1170",fontsize=10,color="white",style="solid",shape="box"];2562 -> 2993[label="",style="solid", color="burlywood", weight=9];
2993 -> 2568[label="",style="solid", color="burlywood", weight=3];
2994[label="vuz117/Zero",fontsize=10,color="white",style="solid",shape="box"];2562 -> 2994[label="",style="solid", color="burlywood", weight=9];
2994 -> 2569[label="",style="solid", color="burlywood", weight=3];
1696[label="vuz58",fontsize=16,color="green",shape="box"];1697[label="vuz57",fontsize=16,color="green",shape="box"];1524[label="primDivNatS vuz5200 (Succ Zero)",fontsize=16,color="burlywood",shape="triangle"];2995[label="vuz5200/Succ vuz52000",fontsize=10,color="white",style="solid",shape="box"];1524 -> 2995[label="",style="solid", color="burlywood", weight=9];
2995 -> 1562[label="",style="solid", color="burlywood", weight=3];
2996[label="vuz5200/Zero",fontsize=10,color="white",style="solid",shape="box"];1524 -> 2996[label="",style="solid", color="burlywood", weight=9];
2996 -> 1563[label="",style="solid", color="burlywood", weight=3];
1525 -> 1524[label="",style="dashed", color="red", weight=0];
1525[label="primDivNatS vuz5200 (Succ Zero)",fontsize=16,color="magenta"];1525 -> 1564[label="",style="dashed", color="magenta", weight=3];
2786 -> 2238[label="",style="dashed", color="red", weight=0];
2786[label="primMinusNatS (Succ vuz135) (Succ vuz136)",fontsize=16,color="magenta"];2786 -> 2793[label="",style="dashed", color="magenta", weight=3];
2786 -> 2794[label="",style="dashed", color="magenta", weight=3];
2785[label="primDivNatS vuz139 (Succ (Succ vuz136))",fontsize=16,color="burlywood",shape="triangle"];2999[label="vuz139/Succ vuz1390",fontsize=10,color="white",style="solid",shape="box"];2785 -> 2999[label="",style="solid", color="burlywood", weight=9];
2999 -> 2795[label="",style="solid", color="burlywood", weight=3];
3000[label="vuz139/Zero",fontsize=10,color="white",style="solid",shape="box"];2785 -> 3000[label="",style="solid", color="burlywood", weight=9];
3000 -> 2796[label="",style="solid", color="burlywood", weight=3];
2278[label="primMinusNatS (Succ vuz10200) vuz103",fontsize=16,color="burlywood",shape="box"];3001[label="vuz103/Succ vuz1030",fontsize=10,color="white",style="solid",shape="box"];2278 -> 3001[label="",style="solid", color="burlywood", weight=9];
3001 -> 2317[label="",style="solid", color="burlywood", weight=3];
3002[label="vuz103/Zero",fontsize=10,color="white",style="solid",shape="box"];2278 -> 3002[label="",style="solid", color="burlywood", weight=9];
3002 -> 2318[label="",style="solid", color="burlywood", weight=3];
2279[label="primMinusNatS Zero vuz103",fontsize=16,color="burlywood",shape="box"];3003[label="vuz103/Succ vuz1030",fontsize=10,color="white",style="solid",shape="box"];2279 -> 3003[label="",style="solid", color="burlywood", weight=9];
3003 -> 2319[label="",style="solid", color="burlywood", weight=3];
3004[label="vuz103/Zero",fontsize=10,color="white",style="solid",shape="box"];2279 -> 3004[label="",style="solid", color="burlywood", weight=9];
3004 -> 2320[label="",style="solid", color="burlywood", weight=3];
2417[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz1130 (Succ (Succ vuz9100)) (primGEqNatS vuz1130 (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS0 vuz1130 (Succ (Succ vuz9100)) (primGEqNatS vuz1130 (Succ (Succ vuz9100))))))",fontsize=16,color="burlywood",shape="box"];3005[label="vuz1130/Succ vuz11300",fontsize=10,color="white",style="solid",shape="box"];2417 -> 3005[label="",style="solid", color="burlywood", weight=9];
3005 -> 2431[label="",style="solid", color="burlywood", weight=3];
3006[label="vuz1130/Zero",fontsize=10,color="white",style="solid",shape="box"];2417 -> 3006[label="",style="solid", color="burlywood", weight=9];
3006 -> 2432[label="",style="solid", color="burlywood", weight=3];
2418[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos Zero) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2418 -> 2433[label="",style="solid", color="black", weight=3];
2427 -> 1940[label="",style="dashed", color="red", weight=0];
2427[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz9000) (Succ Zero) (primGEqNatS vuz9000 Zero))) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS0 (Succ vuz9000) (Succ Zero) (primGEqNatS vuz9000 Zero))))",fontsize=16,color="magenta"];2427 -> 2440[label="",style="dashed", color="magenta", weight=3];
2427 -> 2441[label="",style="dashed", color="magenta", weight=3];
2427 -> 2442[label="",style="dashed", color="magenta", weight=3];
2427 -> 2443[label="",style="dashed", color="magenta", weight=3];
2428[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ Zero) False)) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (primModNatS0 Zero (Succ Zero) False)))",fontsize=16,color="black",shape="box"];2428 -> 2444[label="",style="solid", color="black", weight=3];
2429[label="Integer (Pos (Succ (Succ vuz89))) `quot` Integer (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2429 -> 2445[label="",style="solid", color="black", weight=3];
2430[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (primRemInt (Pos (Succ vuz91)) (Pos (Succ (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2430 -> 2446[label="",style="solid", color="black", weight=3];
1257[label="Succ vuz500",fontsize=16,color="green",shape="box"];1258[label="Zero",fontsize=16,color="green",shape="box"];2481[label="Zero",fontsize=16,color="green",shape="box"];2482[label="Succ vuz45",fontsize=16,color="green",shape="box"];2483[label="Zero",fontsize=16,color="green",shape="box"];2484[label="Succ vuz45",fontsize=16,color="green",shape="box"];1259[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd' (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1259 -> 1290[label="",style="solid", color="black", weight=3];
2450[label="vuz1180",fontsize=16,color="green",shape="box"];2451[label="vuz1190",fontsize=16,color="green",shape="box"];2453[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ (Succ vuz116))) (Pos Zero)) (Integer (Pos (Succ vuz117))) (Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2453 -> 2485[label="",style="solid", color="black", weight=3];
2567[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1170))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2567 -> 2579[label="",style="solid", color="black", weight=3];
2568[label="primDivNatS0 (Succ vuz115) (Succ vuz1170) (primGEqNatS (Succ vuz115) (Succ vuz1170))",fontsize=16,color="black",shape="box"];2568 -> 2580[label="",style="solid", color="black", weight=3];
2569[label="primDivNatS0 (Succ vuz115) Zero (primGEqNatS (Succ vuz115) Zero)",fontsize=16,color="black",shape="box"];2569 -> 2581[label="",style="solid", color="black", weight=3];
1562[label="primDivNatS (Succ vuz52000) (Succ Zero)",fontsize=16,color="black",shape="box"];1562 -> 1588[label="",style="solid", color="black", weight=3];
1563[label="primDivNatS Zero (Succ Zero)",fontsize=16,color="black",shape="box"];1563 -> 1589[label="",style="solid", color="black", weight=3];
1564[label="vuz5200",fontsize=16,color="green",shape="box"];2793[label="Succ vuz136",fontsize=16,color="green",shape="box"];2794[label="Succ vuz135",fontsize=16,color="green",shape="box"];2795[label="primDivNatS (Succ vuz1390) (Succ (Succ vuz136))",fontsize=16,color="black",shape="box"];2795 -> 2797[label="",style="solid", color="black", weight=3];
2796[label="primDivNatS Zero (Succ (Succ vuz136))",fontsize=16,color="black",shape="box"];2796 -> 2798[label="",style="solid", color="black", weight=3];
2317[label="primMinusNatS (Succ vuz10200) (Succ vuz1030)",fontsize=16,color="black",shape="box"];2317 -> 2419[label="",style="solid", color="black", weight=3];
2318[label="primMinusNatS (Succ vuz10200) Zero",fontsize=16,color="black",shape="box"];2318 -> 2420[label="",style="solid", color="black", weight=3];
2319[label="primMinusNatS Zero (Succ vuz1030)",fontsize=16,color="black",shape="box"];2319 -> 2421[label="",style="solid", color="black", weight=3];
2320[label="primMinusNatS Zero Zero",fontsize=16,color="black",shape="box"];2320 -> 2422[label="",style="solid", color="black", weight=3];
2431[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz11300) (Succ (Succ vuz9100)) (primGEqNatS (Succ vuz11300) (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS0 (Succ vuz11300) (Succ (Succ vuz9100)) (primGEqNatS (Succ vuz11300) (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2431 -> 2447[label="",style="solid", color="black", weight=3];
2432[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ (Succ vuz9100)) (primGEqNatS Zero (Succ (Succ vuz9100))))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS0 Zero (Succ (Succ vuz9100)) (primGEqNatS Zero (Succ (Succ vuz9100))))))",fontsize=16,color="black",shape="box"];2432 -> 2448[label="",style="solid", color="black", weight=3];
2433[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 True (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos Zero))",fontsize=16,color="black",shape="box"];2433 -> 2449[label="",style="solid", color="black", weight=3];
2440[label="vuz9000",fontsize=16,color="green",shape="box"];2441[label="Zero",fontsize=16,color="green",shape="box"];2442[label="vuz9000",fontsize=16,color="green",shape="box"];2443[label="Succ Zero",fontsize=16,color="green",shape="box"];2444 -> 1391[label="",style="dashed", color="red", weight=0];
2444[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ Zero)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];2444 -> 2454[label="",style="dashed", color="magenta", weight=3];
2444 -> 2455[label="",style="dashed", color="magenta", weight=3];
2445[label="Integer (primQuotInt (Pos (Succ (Succ vuz89))) (Pos (Succ (Succ Zero))))",fontsize=16,color="green",shape="box"];2445 -> 2456[label="",style="dashed", color="green", weight=3];
2446[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz91) (Succ (Succ vuz90)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS (Succ vuz91) (Succ (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2446 -> 2457[label="",style="solid", color="black", weight=3];
1290[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'2 (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1290 -> 1332[label="",style="solid", color="black", weight=3];
2485[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 False (Integer (Pos (Succ vuz117))) (Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2485 -> 2498[label="",style="solid", color="black", weight=3];
2579[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz1170))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz1170))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];2579 -> 2588[label="",style="solid", color="black", weight=3];
2580 -> 2705[label="",style="dashed", color="red", weight=0];
2580[label="primDivNatS0 (Succ vuz115) (Succ vuz1170) (primGEqNatS vuz115 vuz1170)",fontsize=16,color="magenta"];2580 -> 2718[label="",style="dashed", color="magenta", weight=3];
2580 -> 2719[label="",style="dashed", color="magenta", weight=3];
2580 -> 2720[label="",style="dashed", color="magenta", weight=3];
2580 -> 2721[label="",style="dashed", color="magenta", weight=3];
2581 -> 1666[label="",style="dashed", color="red", weight=0];
2581[label="primDivNatS0 (Succ vuz115) Zero True",fontsize=16,color="magenta"];2581 -> 2591[label="",style="dashed", color="magenta", weight=3];
1588[label="primDivNatS0 vuz52000 Zero (primGEqNatS vuz52000 Zero)",fontsize=16,color="burlywood",shape="box"];3011[label="vuz52000/Succ vuz520000",fontsize=10,color="white",style="solid",shape="box"];1588 -> 3011[label="",style="solid", color="burlywood", weight=9];
3011 -> 1628[label="",style="solid", color="burlywood", weight=3];
3012[label="vuz52000/Zero",fontsize=10,color="white",style="solid",shape="box"];1588 -> 3012[label="",style="solid", color="burlywood", weight=9];
3012 -> 1629[label="",style="solid", color="burlywood", weight=3];
1589[label="Zero",fontsize=16,color="green",shape="box"];2797[label="primDivNatS0 vuz1390 (Succ vuz136) (primGEqNatS vuz1390 (Succ vuz136))",fontsize=16,color="burlywood",shape="box"];3013[label="vuz1390/Succ vuz13900",fontsize=10,color="white",style="solid",shape="box"];2797 -> 3013[label="",style="solid", color="burlywood", weight=9];
3013 -> 2799[label="",style="solid", color="burlywood", weight=3];
3014[label="vuz1390/Zero",fontsize=10,color="white",style="solid",shape="box"];2797 -> 3014[label="",style="solid", color="burlywood", weight=9];
3014 -> 2800[label="",style="solid", color="burlywood", weight=3];
2798[label="Zero",fontsize=16,color="green",shape="box"];2419 -> 2238[label="",style="dashed", color="red", weight=0];
2419[label="primMinusNatS vuz10200 vuz1030",fontsize=16,color="magenta"];2419 -> 2434[label="",style="dashed", color="magenta", weight=3];
2419 -> 2435[label="",style="dashed", color="magenta", weight=3];
2420[label="Succ vuz10200",fontsize=16,color="green",shape="box"];2421[label="Zero",fontsize=16,color="green",shape="box"];2422[label="Zero",fontsize=16,color="green",shape="box"];2447 -> 1940[label="",style="dashed", color="red", weight=0];
2447[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz11300) (Succ (Succ vuz9100)) (primGEqNatS vuz11300 (Succ vuz9100)))) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS0 (Succ vuz11300) (Succ (Succ vuz9100)) (primGEqNatS vuz11300 (Succ vuz9100)))))",fontsize=16,color="magenta"];2447 -> 2458[label="",style="dashed", color="magenta", weight=3];
2447 -> 2459[label="",style="dashed", color="magenta", weight=3];
2447 -> 2460[label="",style="dashed", color="magenta", weight=3];
2447 -> 2461[label="",style="dashed", color="magenta", weight=3];
2448[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ (Succ vuz9100)) False)) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (primModNatS0 Zero (Succ (Succ vuz9100)) False)))",fontsize=16,color="black",shape="box"];2448 -> 2462[label="",style="solid", color="black", weight=3];
2449[label="Integer (Pos (Succ (Succ vuz89))) `quot` Integer (Pos (Succ (Succ (Succ vuz9100))))",fontsize=16,color="black",shape="box"];2449 -> 2463[label="",style="solid", color="black", weight=3];
2454[label="Succ Zero",fontsize=16,color="green",shape="box"];2455[label="vuz89",fontsize=16,color="green",shape="box"];2456[label="primQuotInt (Pos (Succ (Succ vuz89))) (Pos (Succ (Succ Zero)))",fontsize=16,color="black",shape="box"];2456 -> 2486[label="",style="solid", color="black", weight=3];
2457[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz91 (Succ vuz90) (primGEqNatS vuz91 (Succ vuz90)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS0 vuz91 (Succ vuz90) (primGEqNatS vuz91 (Succ vuz90)))))",fontsize=16,color="burlywood",shape="box"];3017[label="vuz91/Succ vuz910",fontsize=10,color="white",style="solid",shape="box"];2457 -> 3017[label="",style="solid", color="burlywood", weight=9];
3017 -> 2487[label="",style="solid", color="burlywood", weight=3];
3018[label="vuz91/Zero",fontsize=10,color="white",style="solid",shape="box"];2457 -> 3018[label="",style="solid", color="burlywood", weight=9];
3018 -> 2488[label="",style="solid", color="burlywood", weight=3];
1332[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (Succ (Succ vuz500))) `rem` Integer (Pos (Succ Zero)))",fontsize=16,color="black",shape="box"];1332 -> 1367[label="",style="solid", color="black", weight=3];
2498[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'0 (Integer (Pos (Succ vuz117))) (Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2498 -> 2506[label="",style="solid", color="black", weight=3];
2588[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2588 -> 2599[label="",style="solid", color="black", weight=3];
2718[label="vuz1170",fontsize=16,color="green",shape="box"];2719[label="vuz115",fontsize=16,color="green",shape="box"];2720[label="vuz1170",fontsize=16,color="green",shape="box"];2721[label="vuz115",fontsize=16,color="green",shape="box"];2591[label="vuz115",fontsize=16,color="green",shape="box"];1666[label="primDivNatS0 (Succ vuz520000) Zero True",fontsize=16,color="black",shape="triangle"];1666 -> 1700[label="",style="solid", color="black", weight=3];
1628[label="primDivNatS0 (Succ vuz520000) Zero (primGEqNatS (Succ vuz520000) Zero)",fontsize=16,color="black",shape="box"];1628 -> 1666[label="",style="solid", color="black", weight=3];
1629[label="primDivNatS0 Zero Zero (primGEqNatS Zero Zero)",fontsize=16,color="black",shape="box"];1629 -> 1667[label="",style="solid", color="black", weight=3];
2799[label="primDivNatS0 (Succ vuz13900) (Succ vuz136) (primGEqNatS (Succ vuz13900) (Succ vuz136))",fontsize=16,color="black",shape="box"];2799 -> 2801[label="",style="solid", color="black", weight=3];
2800[label="primDivNatS0 Zero (Succ vuz136) (primGEqNatS Zero (Succ vuz136))",fontsize=16,color="black",shape="box"];2800 -> 2802[label="",style="solid", color="black", weight=3];
2434[label="vuz1030",fontsize=16,color="green",shape="box"];2435[label="vuz10200",fontsize=16,color="green",shape="box"];2458[label="vuz11300",fontsize=16,color="green",shape="box"];2459[label="Succ vuz9100",fontsize=16,color="green",shape="box"];2460[label="vuz11300",fontsize=16,color="green",shape="box"];2461[label="Succ (Succ vuz9100)",fontsize=16,color="green",shape="box"];2462 -> 1391[label="",style="dashed", color="red", weight=0];
2462[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ (Succ vuz9100))))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];2462 -> 2493[label="",style="dashed", color="magenta", weight=3];
2462 -> 2494[label="",style="dashed", color="magenta", weight=3];
2463[label="Integer (primQuotInt (Pos (Succ (Succ vuz89))) (Pos (Succ (Succ (Succ vuz9100)))))",fontsize=16,color="green",shape="box"];2463 -> 2495[label="",style="dashed", color="green", weight=3];
2486[label="Pos (primDivNatS (Succ (Succ vuz89)) (Succ (Succ Zero)))",fontsize=16,color="green",shape="box"];2486 -> 2499[label="",style="dashed", color="green", weight=3];
2487[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz910) (Succ vuz90) (primGEqNatS (Succ vuz910) (Succ vuz90)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS0 (Succ vuz910) (Succ vuz90) (primGEqNatS (Succ vuz910) (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2487 -> 2500[label="",style="solid", color="black", weight=3];
2488[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz90) (primGEqNatS Zero (Succ vuz90)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS0 Zero (Succ vuz90) (primGEqNatS Zero (Succ vuz90)))))",fontsize=16,color="black",shape="box"];2488 -> 2501[label="",style="solid", color="black", weight=3];
1367[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))) == fromInt (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1367 -> 1413[label="",style="solid", color="black", weight=3];
2506[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd' (Integer (Pos (Succ (Succ vuz116)))) (Integer (Pos (Succ vuz117)) `rem` Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2506 -> 2519[label="",style="solid", color="black", weight=3];
2599[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];2599 -> 2611[label="",style="solid", color="black", weight=3];
1700[label="Succ (primDivNatS (primMinusNatS (Succ vuz520000) Zero) (Succ Zero))",fontsize=16,color="green",shape="box"];1700 -> 1708[label="",style="dashed", color="green", weight=3];
1667 -> 1077[label="",style="dashed", color="red", weight=0];
1667[label="primDivNatS0 Zero Zero True",fontsize=16,color="magenta"];2801 -> 2580[label="",style="dashed", color="red", weight=0];
2801[label="primDivNatS0 (Succ vuz13900) (Succ vuz136) (primGEqNatS vuz13900 vuz136)",fontsize=16,color="magenta"];2801 -> 2803[label="",style="dashed", color="magenta", weight=3];
2801 -> 2804[label="",style="dashed", color="magenta", weight=3];
2802[label="primDivNatS0 Zero (Succ vuz136) False",fontsize=16,color="black",shape="box"];2802 -> 2805[label="",style="solid", color="black", weight=3];
2493[label="Succ (Succ vuz9100)",fontsize=16,color="green",shape="box"];2494[label="vuz89",fontsize=16,color="green",shape="box"];2495[label="primQuotInt (Pos (Succ (Succ vuz89))) (Pos (Succ (Succ (Succ vuz9100))))",fontsize=16,color="black",shape="box"];2495 -> 2502[label="",style="solid", color="black", weight=3];
2499 -> 2785[label="",style="dashed", color="red", weight=0];
2499[label="primDivNatS (Succ (Succ vuz89)) (Succ (Succ Zero))",fontsize=16,color="magenta"];2499 -> 2787[label="",style="dashed", color="magenta", weight=3];
2499 -> 2788[label="",style="dashed", color="magenta", weight=3];
2500 -> 1940[label="",style="dashed", color="red", weight=0];
2500[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz910) (Succ vuz90) (primGEqNatS vuz910 vuz90))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS0 (Succ vuz910) (Succ vuz90) (primGEqNatS vuz910 vuz90))))",fontsize=16,color="magenta"];2500 -> 2508[label="",style="dashed", color="magenta", weight=3];
2500 -> 2509[label="",style="dashed", color="magenta", weight=3];
2500 -> 2510[label="",style="dashed", color="magenta", weight=3];
2500 -> 2511[label="",style="dashed", color="magenta", weight=3];
2501[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero (Succ vuz90) False)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (primModNatS0 Zero (Succ vuz90) False)))",fontsize=16,color="black",shape="box"];2501 -> 2512[label="",style="solid", color="black", weight=3];
1413[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))) == Integer (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1413 -> 1454[label="",style="solid", color="black", weight=3];
2519[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'2 (Integer (Pos (Succ (Succ vuz116)))) (Integer (Pos (Succ vuz117)) `rem` Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2519 -> 2529[label="",style="solid", color="black", weight=3];
2611 -> 982[label="",style="dashed", color="red", weight=0];
2611[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz1170))) (Pos (Succ Zero))))",fontsize=16,color="magenta"];2611 -> 2625[label="",style="dashed", color="magenta", weight=3];
2611 -> 2626[label="",style="dashed", color="magenta", weight=3];
2611 -> 2627[label="",style="dashed", color="magenta", weight=3];
1708 -> 1524[label="",style="dashed", color="red", weight=0];
1708[label="primDivNatS (primMinusNatS (Succ vuz520000) Zero) (Succ Zero)",fontsize=16,color="magenta"];1708 -> 1749[label="",style="dashed", color="magenta", weight=3];
2803[label="vuz136",fontsize=16,color="green",shape="box"];2804[label="vuz13900",fontsize=16,color="green",shape="box"];2805[label="Zero",fontsize=16,color="green",shape="box"];2502[label="Pos (primDivNatS (Succ (Succ vuz89)) (Succ (Succ (Succ vuz9100))))",fontsize=16,color="green",shape="box"];2502 -> 2513[label="",style="dashed", color="green", weight=3];
2787[label="Succ (Succ vuz89)",fontsize=16,color="green",shape="box"];2788[label="Zero",fontsize=16,color="green",shape="box"];2508[label="vuz910",fontsize=16,color="green",shape="box"];2509[label="vuz90",fontsize=16,color="green",shape="box"];2510[label="vuz910",fontsize=16,color="green",shape="box"];2511[label="Succ vuz90",fontsize=16,color="green",shape="box"];2512 -> 1391[label="",style="dashed", color="red", weight=0];
2512[label="Integer (Pos (Succ (Succ vuz89))) `quot` gcd0Gcd'1 (primEqInt (Pos (Succ Zero)) (Pos Zero)) (Integer (Pos (Succ (Succ vuz90)))) (Integer (Pos (Succ Zero)))",fontsize=16,color="magenta"];2512 -> 2521[label="",style="dashed", color="magenta", weight=3];
2512 -> 2522[label="",style="dashed", color="magenta", weight=3];
1454[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (primRemInt (Pos (Succ (Succ vuz500))) (Pos (Succ Zero))))",fontsize=16,color="black",shape="box"];1454 -> 1491[label="",style="solid", color="black", weight=3];
2529[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (Pos (Succ vuz117)) `rem` Integer (Pos (Succ (Succ vuz116))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz116)))) (Integer (Pos (Succ vuz117)) `rem` Integer (Pos (Succ (Succ vuz116))))",fontsize=16,color="black",shape="box"];2529 -> 2542[label="",style="solid", color="black", weight=3];
2625[label="vuz115",fontsize=16,color="green",shape="box"];2626[label="vuz1170",fontsize=16,color="green",shape="box"];2627[label="Zero",fontsize=16,color="green",shape="box"];1749[label="primMinusNatS (Succ vuz520000) Zero",fontsize=16,color="black",shape="triangle"];1749 -> 1790[label="",style="solid", color="black", weight=3];
2513 -> 2785[label="",style="dashed", color="red", weight=0];
2513[label="primDivNatS (Succ (Succ vuz89)) (Succ (Succ (Succ vuz9100)))",fontsize=16,color="magenta"];2513 -> 2791[label="",style="dashed", color="magenta", weight=3];
2513 -> 2792[label="",style="dashed", color="magenta", weight=3];
2521[label="Succ vuz90",fontsize=16,color="green",shape="box"];2522[label="vuz89",fontsize=16,color="green",shape="box"];1491[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ (Succ vuz500)) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ (Succ vuz500)) (Succ Zero))))",fontsize=16,color="black",shape="box"];1491 -> 1530[label="",style="solid", color="black", weight=3];
2542[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))) == fromInt (Pos Zero)) (Integer (Pos (Succ (Succ vuz116)))) (Integer (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))))",fontsize=16,color="black",shape="box"];2542 -> 2549[label="",style="solid", color="black", weight=3];
1790[label="Succ vuz520000",fontsize=16,color="green",shape="box"];2791[label="Succ (Succ vuz89)",fontsize=16,color="green",shape="box"];2792[label="Succ vuz9100",fontsize=16,color="green",shape="box"];1530[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz500) Zero (primGEqNatS (Succ vuz500) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz500) Zero (primGEqNatS (Succ vuz500) Zero))))",fontsize=16,color="black",shape="box"];1530 -> 1590[label="",style="solid", color="black", weight=3];
2549[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (Integer (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))) == Integer (Pos Zero)) (Integer (Pos (Succ (Succ vuz116)))) (Integer (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))))",fontsize=16,color="black",shape="box"];2549 -> 2556[label="",style="solid", color="black", weight=3];
1590[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz500) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz500) Zero True)))",fontsize=16,color="black",shape="triangle"];1590 -> 1630[label="",style="solid", color="black", weight=3];
2556[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz116)))) (Integer (primRemInt (Pos (Succ vuz117)) (Pos (Succ (Succ vuz116)))))",fontsize=16,color="black",shape="box"];2556 -> 2563[label="",style="solid", color="black", weight=3];
1630[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (primMinusNatS (Succ vuz500) Zero) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (primMinusNatS (Succ vuz500) Zero) (Succ Zero))))",fontsize=16,color="black",shape="box"];1630 -> 1668[label="",style="solid", color="black", weight=3];
2563 -> 2464[label="",style="dashed", color="red", weight=0];
2563[label="Integer (Neg (Succ (Succ vuz115))) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz117) (Succ (Succ vuz116)))) (Pos Zero)) (Integer (Pos (Succ (Succ vuz116)))) (Integer (Pos (primModNatS (Succ vuz117) (Succ (Succ vuz116)))))",fontsize=16,color="magenta"];2563 -> 2572[label="",style="dashed", color="magenta", weight=3];
2563 -> 2573[label="",style="dashed", color="magenta", weight=3];
2563 -> 2574[label="",style="dashed", color="magenta", weight=3];
1668[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS (Succ vuz500) (Succ Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS (Succ vuz500) (Succ Zero))))",fontsize=16,color="black",shape="box"];1668 -> 1720[label="",style="solid", color="black", weight=3];
2572[label="Succ vuz117",fontsize=16,color="green",shape="box"];2573[label="Succ vuz117",fontsize=16,color="green",shape="box"];2574[label="Succ vuz116",fontsize=16,color="green",shape="box"];1720[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 vuz500 Zero (primGEqNatS vuz500 Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 vuz500 Zero (primGEqNatS vuz500 Zero))))",fontsize=16,color="burlywood",shape="box"];3029[label="vuz500/Succ vuz5000",fontsize=10,color="white",style="solid",shape="box"];1720 -> 3029[label="",style="solid", color="burlywood", weight=9];
3029 -> 1758[label="",style="solid", color="burlywood", weight=3];
3030[label="vuz500/Zero",fontsize=10,color="white",style="solid",shape="box"];1720 -> 3030[label="",style="solid", color="burlywood", weight=9];
3030 -> 1759[label="",style="solid", color="burlywood", weight=3];
1758[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) Zero (primGEqNatS (Succ vuz5000) Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz5000) Zero (primGEqNatS (Succ vuz5000) Zero))))",fontsize=16,color="black",shape="box"];1758 -> 1799[label="",style="solid", color="black", weight=3];
1759[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero (primGEqNatS Zero Zero))))",fontsize=16,color="black",shape="box"];1759 -> 1800[label="",style="solid", color="black", weight=3];
1799 -> 1590[label="",style="dashed", color="red", weight=0];
1799[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 (Succ vuz5000) Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 (Succ vuz5000) Zero True)))",fontsize=16,color="magenta"];1799 -> 1844[label="",style="dashed", color="magenta", weight=3];
1800 -> 1205[label="",style="dashed", color="red", weight=0];
1800[label="Integer (Neg (Succ Zero)) `quot` gcd0Gcd'1 (primEqInt (Pos (primModNatS0 Zero Zero True)) (Pos Zero)) (Integer (Pos (Succ Zero))) (Integer (Pos (primModNatS0 Zero Zero True)))",fontsize=16,color="magenta"];1800 -> 1845[label="",style="dashed", color="magenta", weight=3];
1844[label="vuz5000",fontsize=16,color="green",shape="box"];1845[label="Integer (Neg (Succ Zero))",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primMulNat(Succ(vuz30000)) → new_primMulNat(vuz30000)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primMinusNatS(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS(vuz10200, vuz1030)

From the DPs we obtained the following set of size-change graphs:

new_primMinusNatS(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS(vuz10200, vuz1030)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Zero) → new_primDivNatS(new_primMinusNatS0(Succ(vuz135), Succ(vuz136)), vuz136)
new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Succ(vuz1380)) → new_primDivNatS00(vuz135, vuz136, vuz1370, vuz1380)
new_primDivNatS0(vuz115, vuz1170) → new_primDivNatS0(vuz115, vuz1170)
new_primDivNatS01(vuz135, vuz136) → new_primDivNatS(new_primMinusNatS0(Succ(vuz135), Succ(vuz136)), vuz136)
new_primDivNatS00(vuz135, vuz136, Zero, Zero) → new_primDivNatS01(vuz135, vuz136)
new_primDivNatS(Succ(Succ(vuz13900)), vuz136) → new_primDivNatS0(vuz13900, vuz136)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 4 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz115, vuz1170) → new_primDivNatS0(vuz115, vuz1170)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz115, vuz1170) → new_primDivNatS0(vuz115, vuz1170)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ NonTerminationProof

                                ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS0(vuz115, vuz1170) → new_primDivNatS0(vuz115, vuz1170)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_primDivNatS0(vuz115, vuz1170) → new_primDivNatS0(vuz115, vuz1170)

The TRS R consists of the following rules:none

s = new_primDivNatS0(vuz115, vuz1170) evaluates to t =new_primDivNatS0(vuz115, vuz1170)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_primDivNatS0(vuz115, vuz1170) to new_primDivNatS0(vuz115, vuz1170).

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Succ(vuz1380)) → new_primDivNatS00(vuz135, vuz136, vuz1370, vuz1380)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Succ(vuz1380)) → new_primDivNatS00(vuz135, vuz136, vuz1370, vuz1380)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ UsableRulesProof

                                    ↳ QDP

                                      ↳ QReductionProof

                                        ↳ QDP

                                          ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Succ(vuz1380)) → new_primDivNatS00(vuz135, vuz136, vuz1370, vuz1380)

From the DPs we obtained the following set of size-change graphs:

new_primDivNatS00(vuz135, vuz136, Succ(vuz1370), Succ(vuz1380)) → new_primDivNatS00(vuz135, vuz136, vuz1370, vuz1380)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS1(Succ(vuz1070), vuz108) → new_primDivNatS1(vuz1070, vuz108)

From the DPs we obtained the following set of size-change graphs:

new_primDivNatS1(Succ(vuz1070), vuz108) → new_primDivNatS1(vuz1070, vuz108)
The graph contains the following edges 1 > 1, 2 >= 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS02(vuz520000) → new_primDivNatS2(new_primMinusNatS1(vuz520000))
new_primDivNatS2(Succ(Succ(vuz520000))) → new_primDivNatS2(new_primMinusNatS1(vuz520000))

The TRS R consists of the following rules:

new_primMinusNatS1(vuz520000) → Succ(vuz520000)

The set Q consists of the following terms:

new_primMinusNatS1(x0)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primDivNatS2(Succ(Succ(vuz520000))) → new_primDivNatS2(new_primMinusNatS1(vuz520000))

The TRS R consists of the following rules:

new_primMinusNatS1(vuz520000) → Succ(vuz520000)

The set Q consists of the following terms:

new_primMinusNatS1(x0)

We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_primDivNatS2(Succ(Succ(vuz520000))) → new_primDivNatS2(new_primMinusNatS1(vuz520000))

Strictly oriented rules of the TRS R:

new_primMinusNatS1(vuz520000) → Succ(vuz520000)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + 2·x₁
POL(new_primDivNatS2(x₁)) = x₁
POL(new_primMinusNatS1(x₁)) = 2 + 2·x₁

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ RuleRemovalProof

                                  ↳ QDP

                                    ↳ PisEmptyProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
P is empty.
R is empty.
The set Q consists of the following terms:

new_primMinusNatS1(x0)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot(Succ(vuz5000)) → new_quot(vuz5000)

From the DPs we obtained the following set of size-change graphs:

new_quot(Succ(vuz5000)) → new_quot(vuz5000)
The graph contains the following edges 1 > 1

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot2(vuz115, vuz116, vuz117) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)
new_quot1(vuz115, Succ(Zero), Succ(vuz1170), vuz120) → new_quot3(vuz115, vuz1170, Zero)
new_quot3(vuz44, vuz45, vuz14) → new_quot1(vuz44, Succ(Succ(vuz45)), vuz14, Succ(Succ(vuz45)))

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot3(vuz44, vuz45, vuz14) → new_quot1(vuz44, Succ(Succ(vuz45)), vuz14, Succ(Succ(vuz45))) we obtained the following new rules:

new_quot3(z0, z1, Zero) → new_quot1(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot3(z0, z1, Zero) → new_quot1(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot2(vuz115, vuz116, vuz117) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot1(vuz115, Succ(Zero), Succ(vuz1170), vuz120) → new_quot3(vuz115, vuz1170, Zero)
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_quot2(vuz115, vuz116, vuz117) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117)) at position [1] we obtained the following new rules:

new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, new_primMinusNatS0(Succ(x0), Zero))
new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(Succ(x0), Succ(x1)))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, new_primMinusNatS0(Succ(x0), Zero))
new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot3(z0, z1, Zero) → new_quot1(z0, Succ(Succ(z1)), Zero, Succ(Succ(z1)))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(Succ(x0), Succ(x1)))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)
new_quot1(vuz115, Succ(Zero), Succ(vuz1170), vuz120) → new_quot3(vuz115, vuz1170, Zero)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, new_primMinusNatS0(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, new_primMinusNatS0(Succ(x0), Zero))

The TRS R consists of the following rules:

new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, new_primMinusNatS0(Succ(x0), Zero)) at position [3] we obtained the following new rules:

new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

The TRS R consists of the following rules:

new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot1(vuz115, Succ(Succ(vuz12100)), Zero, vuz120) → new_quot2(vuz115, vuz12100, Zero) we obtained the following new rules:

new_quot1(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot2(z0, x1, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                                            ↳ QDP

                                                              ↳ RuleRemovalProof

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot2(z0, x1, Zero)
new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the rule removal processor [15] with the following polynomial ordering [25], at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

new_quot1(z0, Succ(Succ(x1)), Zero, Succ(Succ(x1))) → new_quot2(z0, x1, Zero)

Used ordering: POLO with Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_quot1(x₁, x₂, x₃, x₄)) = x₁ + x₂ + 2·x₃ + x₄
POL(new_quot2(x₁, x₂, x₃)) = 2 + x₁ + 2·x₂ + 2·x₃

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                          ↳ UsableRulesProof

                                            ↳ QDP

                                              ↳ Rewriting

                                                ↳ QDP

                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                                                      ↳ QReductionProof

                                                        ↳ QDP

                                                          ↳ Instantiation

                                                            ↳ QDP

                                                              ↳ RuleRemovalProof

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                        ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot2(y0, x0, Zero) → new_quot1(y0, Succ(x0), Zero, Succ(x0))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(Succ(x0), Succ(x1)))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(Succ(x0), Succ(x1))) at position [3] we obtained the following new rules:

new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(x0, x1))

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(x0, x1))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot2(y0, x0, Succ(x1)) → new_quot1(y0, new_primMinusNatS0(x0, x1), Succ(x1), new_primMinusNatS0(x0, x1))

The remaining pairs can at least be oriented weakly.

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( new_primMinusNatS0(x₁, x₂) ) =

/	1	\
\	0	/

/	0	0	\
\	0	1	/

x₁

/	0	0	\
\	0	0	/

x₂

M( Succ(x₁) ) =

/	1	\
\	0	/

/	0	0	\
\	1	1	/

x₁

M( Zero ) =

/	0	\
\	0	/

Tuple symbols:

M( new_quot1(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

M( new_quot2(x₁, ..., x₃) ) =

[

]

x₁

[

]

x₂

[

]

x₃

M( new_quot0(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

Matrix type:
We used a basic matrix type which is not further parametrizeable.

As matrix orders are CE-compatible, we used usable rules w.r.t. argument filtering in the order.
The following usable rules [17] were oriented:

new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))
new_quot0(vuz115, vuz116, vuz117, Zero, Zero) → new_quot2(vuz115, vuz116, vuz117)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Zero) → new_quot1(vuz115, new_primMinusNatS0(Succ(vuz116), vuz117), vuz117, new_primMinusNatS0(Succ(vuz116), vuz117))

The remaining pairs can at least be oriented weakly.

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)

Used ordering: Matrix interpretation [3]:
Non-tuple symbols:

M( new_primMinusNatS0(x₁, x₂) ) =

/	0	\
\	0	/

/	1	0	\
\	0	0	/

x₁

/	0	0	\
\	1	1	/

x₂

M( Succ(x₁) ) =

/	0	\
\	1	/

/	1	1	\
\	0	0	/

x₁

M( Zero ) =

/	0	\
\	1	/

Tuple symbols:

M( new_quot1(x₁, ..., x₄) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

M( new_quot0(x₁, ..., x₅) ) =

[

]

x₁

[

]

x₂

[

]

x₃

[

]

x₄

[

]

x₅

new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_quot1(vuz115, Succ(Succ(vuz12100)), Succ(vuz1170), vuz120) → new_quot0(vuz115, vuz12100, Succ(vuz1170), vuz12100, vuz1170) we obtained the following new rules:

new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The DP Problem is simplified using the Induction Calculus [18] with the following steps:
Note that final constraints are written in bold face.

For Pair new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117)) the following chains were created:

We consider the chain new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190), new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117)) which results in the following constraint:
(1) (new_quot0(x4, x5, x6, x7, x8)=new_quot0(x9, x10, x11, Zero, Succ(x12)) ⇒ new_quot0(x9, x10, x11, Zero, Succ(x12))≥new_quot1(x9, Succ(x11), Succ(x10), Succ(x11)))

We simplified constraint (1) using rules (I), (II), (III) which results in the following new constraint:
(2) (new_quot0(x4, x5, x6, Zero, Succ(x12))≥new_quot1(x4, Succ(x6), Succ(x5), Succ(x6)))
We consider the chain new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1), new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117)) which results in the following constraint:
(3) (new_quot0(x13, x14, Succ(x15), x14, x15)=new_quot0(x16, x17, x18, Zero, Succ(x19)) ⇒ new_quot0(x16, x17, x18, Zero, Succ(x19))≥new_quot1(x16, Succ(x18), Succ(x17), Succ(x18)))

We simplified constraint (3) using rules (I), (II), (III) which results in the following new constraint:
(4) (new_quot0(x13, Zero, Succ(Succ(x19)), Zero, Succ(x19))≥new_quot1(x13, Succ(Succ(Succ(x19))), Succ(Zero), Succ(Succ(Succ(x19)))))

For Pair new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190) the following chains were created:

We consider the chain new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190), new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190) which results in the following constraint:
(5) (new_quot0(x24, x25, x26, x27, x28)=new_quot0(x29, x30, x31, Succ(x32), Succ(x33)) ⇒ new_quot0(x29, x30, x31, Succ(x32), Succ(x33))≥new_quot0(x29, x30, x31, x32, x33))

We simplified constraint (5) using rules (I), (II), (III) which results in the following new constraint:
(6) (new_quot0(x24, x25, x26, Succ(x32), Succ(x33))≥new_quot0(x24, x25, x26, x32, x33))
We consider the chain new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1), new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190) which results in the following constraint:
(7) (new_quot0(x34, x35, Succ(x36), x35, x36)=new_quot0(x37, x38, x39, Succ(x40), Succ(x41)) ⇒ new_quot0(x37, x38, x39, Succ(x40), Succ(x41))≥new_quot0(x37, x38, x39, x40, x41))

We simplified constraint (7) using rules (I), (II), (III) which results in the following new constraint:
(8) (new_quot0(x34, Succ(x40), Succ(Succ(x41)), Succ(x40), Succ(x41))≥new_quot0(x34, Succ(x40), Succ(Succ(x41)), x40, x41))

For Pair new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1) the following chains were created:

We consider the chain new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117)), new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1) which results in the following constraint:
(9) (new_quot1(x42, Succ(x44), Succ(x43), Succ(x44))=new_quot1(x46, Succ(Succ(x47)), Succ(x48), Succ(Succ(x47))) ⇒ new_quot1(x46, Succ(Succ(x47)), Succ(x48), Succ(Succ(x47)))≥new_quot0(x46, x47, Succ(x48), x47, x48))

We simplified constraint (9) using rules (I), (II), (III) which results in the following new constraint:
(10) (new_quot1(x42, Succ(Succ(x47)), Succ(x43), Succ(Succ(x47)))≥new_quot0(x42, x47, Succ(x43), x47, x43))

To summarize, we get the following constraints P_≥ for the following pairs.

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
- (new_quot0(x4, x5, x6, Zero, Succ(x12))≥new_quot1(x4, Succ(x6), Succ(x5), Succ(x6)))
- (new_quot0(x13, Zero, Succ(Succ(x19)), Zero, Succ(x19))≥new_quot1(x13, Succ(Succ(Succ(x19))), Succ(Zero), Succ(Succ(Succ(x19)))))
new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
- (new_quot0(x24, x25, x26, Succ(x32), Succ(x33))≥new_quot0(x24, x25, x26, x32, x33))
- (new_quot0(x34, Succ(x40), Succ(Succ(x41)), Succ(x40), Succ(x41))≥new_quot0(x34, Succ(x40), Succ(Succ(x41)), x40, x41))
new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1)
- (new_quot1(x42, Succ(Succ(x47)), Succ(x43), Succ(Succ(x47)))≥new_quot0(x42, x47, Succ(x43), x47, x43))

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation [18]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(c) = -1
POL(new_quot0(x₁, x₂, x₃, x₄, x₅)) = -1 + x₁ + x₂ - x₄ + x₅
POL(new_quot1(x₁, x₂, x₃, x₄)) = -1 + x₁ + x₂ + x₃ - x₄

The following pairs are in P_>:

new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1)

The following pairs are in P_bound:

new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))
new_quot1(z0, Succ(Succ(x1)), Succ(z1), Succ(Succ(x1))) → new_quot0(z0, x1, Succ(z1), x1, z1)

There are no usable rules

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                                                                        ↳ QDP

                                                                          ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
new_quot0(vuz115, vuz116, vuz117, Zero, Succ(vuz1190)) → new_quot1(vuz115, Succ(vuz117), Succ(vuz116), Succ(vuz117))

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ AND

                                        ↳ QDP

                                        ↳ QDP

                                          ↳ Rewriting

                                            ↳ QDP

                                              ↳ QDPOrderProof

                                                ↳ QDP

                                                  ↳ DependencyGraphProof

                                                    ↳ QDP

                                                      ↳ QDPOrderProof

                                                        ↳ QDP

                                                          ↳ UsableRulesProof

                                                            ↳ QDP

                                                              ↳ QReductionProof

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonInfProof

                                                                        ↳ QDP

                                                                          ↳ DependencyGraphProof

                                                                            ↳ QDP

                                                                              ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)

From the DPs we obtained the following set of size-change graphs:

new_quot0(vuz115, vuz116, vuz117, Succ(vuz1180), Succ(vuz1190)) → new_quot0(vuz115, vuz116, vuz117, vuz1180, vuz1190)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot4(vuz46, Succ(vuz470)) → new_quot4(vuz46, vuz470)
new_quot5(vuz46, Succ(vuz470)) → new_quot4(vuz46, vuz470)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPSizeChangeProof

                          ↳ QDP

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot4(vuz46, Succ(vuz470)) → new_quot4(vuz46, vuz470)

From the DPs we obtained the following set of size-change graphs:

new_quot4(vuz46, Succ(vuz470)) → new_quot4(vuz46, vuz470)
The graph contains the following edges 1 >= 1, 2 > 2

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, Succ(Succ(vuz9000)), Succ(Zero), Succ(vuz920), Zero) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)
new_quot8(vuz89, Zero, Succ(Succ(vuz9100))) → new_quot7(vuz89, Zero, vuz9100, Zero)
new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, Succ(vuz900), Succ(Succ(vuz9100)), Succ(vuz920), Zero) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(vuz900), Succ(Succ(vuz9100))) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(Succ(vuz9000)), Succ(Zero)) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)
new_quot6(vuz89, Zero, Succ(Succ(vuz9100)), Succ(vuz920), Zero) → new_quot7(vuz89, Zero, vuz9100, Zero)
new_quot6(vuz89, vuz90, vuz91, Zero, Zero) → new_quot8(vuz89, vuz90, vuz91)
new_quot7(vuz89, Succ(Succ(vuz11300)), vuz9100, vuz112) → new_quot6(vuz89, vuz11300, Succ(Succ(vuz9100)), vuz11300, Succ(vuz9100))
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, Succ(Succ(vuz9000)), Succ(Zero), Succ(vuz920), Zero) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)
new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, Succ(vuz900), Succ(Succ(vuz9100)), Succ(vuz920), Zero) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(vuz900), Succ(Succ(vuz9100))) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(Succ(vuz9000)), Succ(Zero)) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)
new_quot6(vuz89, vuz90, vuz91, Zero, Zero) → new_quot8(vuz89, vuz90, vuz91)
new_quot7(vuz89, Succ(Succ(vuz11300)), vuz9100, vuz112) → new_quot6(vuz89, vuz11300, Succ(Succ(vuz9100)), vuz11300, Succ(vuz9100))
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_quot6(vuz89, Succ(Succ(vuz9000)), Succ(Zero), Succ(vuz920), Zero) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)
new_quot6(vuz89, Succ(vuz900), Succ(Succ(vuz9100)), Succ(vuz920), Zero) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(vuz900), Succ(Succ(vuz9100))) → new_quot7(vuz89, new_primMinusNatS0(vuz900, vuz9100), vuz9100, new_primMinusNatS0(vuz900, vuz9100))
new_quot8(vuz89, Succ(Succ(vuz9000)), Succ(Zero)) → new_quot6(vuz89, vuz9000, Succ(Zero), vuz9000, Zero)

The remaining pairs can at least be oriented weakly.

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, vuz90, vuz91, Zero, Zero) → new_quot8(vuz89, vuz90, vuz91)
new_quot7(vuz89, Succ(Succ(vuz11300)), vuz9100, vuz112) → new_quot6(vuz89, vuz11300, Succ(Succ(vuz9100)), vuz11300, Succ(vuz9100))
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 1
POL(new_primMinusNatS0(x₁, x₂)) = x₁
POL(new_quot6(x₁, x₂, x₃, x₄, x₅)) = x₂ + x₃
POL(new_quot7(x₁, x₂, x₃, x₄)) = x₂ + x₃
POL(new_quot8(x₁, x₂, x₃)) = x₂ + x₃

The following usable rules [17] were oriented:

new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)
new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, vuz90, vuz91, Zero, Zero) → new_quot8(vuz89, vuz90, vuz91)
new_quot7(vuz89, Succ(Succ(vuz11300)), vuz9100, vuz112) → new_quot6(vuz89, vuz11300, Succ(Succ(vuz9100)), vuz11300, Succ(vuz9100))
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ UsableRulesProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

The TRS R consists of the following rules:

new_primMinusNatS0(Zero, Succ(vuz1030)) → Zero
new_primMinusNatS0(Zero, Zero) → Zero
new_primMinusNatS0(Succ(vuz10200), Succ(vuz1030)) → new_primMinusNatS0(vuz10200, vuz1030)
new_primMinusNatS0(Succ(vuz10200), Zero) → Succ(vuz10200)

The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ UsableRulesProof

                                          ↳ QDP

                                            ↳ QReductionProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

R is empty.
The set Q consists of the following terms:

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primMinusNatS0(Succ(x0), Succ(x1))
new_primMinusNatS0(Zero, Succ(x0))
new_primMinusNatS0(Succ(x0), Zero)
new_primMinusNatS0(Zero, Zero)

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ UsableRulesProof

                                          ↳ QDP

                                            ↳ QReductionProof

                                              ↳ QDP

                                                ↳ NonInfProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The DP Problem is simplified using the Induction Calculus [18] with the following steps:
Note that final constraints are written in bold face.

For Pair new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90) the following chains were created:

We consider the chain new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90), new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90) which results in the following constraint:
(1) (new_quot6(x0, x2, Succ(x1), x2, x1)=new_quot6(x4, x5, Succ(x6), Zero, Succ(x7)) ⇒ new_quot6(x4, x5, Succ(x6), Zero, Succ(x7))≥new_quot6(x4, x6, Succ(x5), x6, x5))

We simplified constraint (1) using rules (I), (II), (III) which results in the following new constraint:
(2) (new_quot6(x0, Zero, Succ(Succ(x7)), Zero, Succ(x7))≥new_quot6(x0, Succ(x7), Succ(Zero), Succ(x7), Zero))
We consider the chain new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930), new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90) which results in the following constraint:
(3) (new_quot6(x8, x9, x10, x11, x12)=new_quot6(x13, x14, Succ(x15), Zero, Succ(x16)) ⇒ new_quot6(x13, x14, Succ(x15), Zero, Succ(x16))≥new_quot6(x13, x15, Succ(x14), x15, x14))

We simplified constraint (3) using rules (I), (II), (III) which results in the following new constraint:
(4) (new_quot6(x8, x9, Succ(x15), Zero, Succ(x16))≥new_quot6(x8, x15, Succ(x9), x15, x9))

For Pair new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930) the following chains were created:

We consider the chain new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90), new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930) which results in the following constraint:
(5) (new_quot6(x17, x19, Succ(x18), x19, x18)=new_quot6(x21, x22, x23, Succ(x24), Succ(x25)) ⇒ new_quot6(x21, x22, x23, Succ(x24), Succ(x25))≥new_quot6(x21, x22, x23, x24, x25))

We simplified constraint (5) using rules (I), (II), (III) which results in the following new constraint:
(6) (new_quot6(x17, Succ(x24), Succ(Succ(x25)), Succ(x24), Succ(x25))≥new_quot6(x17, Succ(x24), Succ(Succ(x25)), x24, x25))
We consider the chain new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930), new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930) which results in the following constraint:
(7) (new_quot6(x26, x27, x28, x29, x30)=new_quot6(x31, x32, x33, Succ(x34), Succ(x35)) ⇒ new_quot6(x31, x32, x33, Succ(x34), Succ(x35))≥new_quot6(x31, x32, x33, x34, x35))

We simplified constraint (7) using rules (I), (II), (III) which results in the following new constraint:
(8) (new_quot6(x26, x27, x28, Succ(x34), Succ(x35))≥new_quot6(x26, x27, x28, x34, x35))

To summarize, we get the following constraints P_≥ for the following pairs.

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)
- (new_quot6(x0, Zero, Succ(Succ(x7)), Zero, Succ(x7))≥new_quot6(x0, Succ(x7), Succ(Zero), Succ(x7), Zero))
- (new_quot6(x8, x9, Succ(x15), Zero, Succ(x16))≥new_quot6(x8, x15, Succ(x9), x15, x9))
new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)
- (new_quot6(x17, Succ(x24), Succ(Succ(x25)), Succ(x24), Succ(x25))≥new_quot6(x17, Succ(x24), Succ(Succ(x25)), x24, x25))
- (new_quot6(x26, x27, x28, Succ(x34), Succ(x35))≥new_quot6(x26, x27, x28, x34, x35))

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(c) = -1
POL(new_quot6(x₁, x₂, x₃, x₄, x₅)) = -1 + x₁ + x₂ - x₄ + x₅

The following pairs are in P_>:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)

The following pairs are in P_bound:

new_quot6(vuz89, vuz90, Succ(vuz910), Zero, Succ(vuz930)) → new_quot6(vuz89, vuz910, Succ(vuz90), vuz910, vuz90)

There are no usable rules

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ UsableRulesProof

                                          ↳ QDP

                                            ↳ QReductionProof

                                              ↳ QDP

                                                ↳ NonInfProof

                                                  ↳ QDP

                                                    ↳ QDPSizeChangeProof

                          ↳ QDP

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)

From the DPs we obtained the following set of size-change graphs:

new_quot6(vuz89, vuz90, vuz91, Succ(vuz920), Succ(vuz930)) → new_quot6(vuz89, vuz90, vuz91, vuz920, vuz930)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5

↳ HASKELL

  ↳ IFR

    ↳ HASKELL

      ↳ BR

        ↳ HASKELL

          ↳ COR

            ↳ HASKELL

              ↳ LetRed

                ↳ HASKELL

                  ↳ NumRed

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                      ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_quot9(Zero, Succ(vuz1600)) → new_quot9(Zero, vuz1600)

From the DPs we obtained the following set of size-change graphs:

new_quot9(Zero, Succ(vuz1600)) → new_quot9(Zero, vuz1600)
The graph contains the following edges 1 >= 1, 2 > 2

Haskell To QDPs

primDivNatS0	x y True	= Succ (primDivNatS (primMinusNatS x y) (Succ y))
primDivNatS0	x y False	= Zero

primModNatS0	x y True	= primModNatS (primMinusNatS x y) (Succ y)
primModNatS0	x y False	= Succ x

gcd2	True yz zu	= gcd1 (zu == 0) yz zu
gcd2	zy zz vuu	= gcd0 zz vuu

signumReal2	x True	= 0
signumReal2	x False	= signumReal1 x (x > 0)

signumReal1	x True	= 1
signumReal1	x False	= signumReal0 x otherwise

reduce2Reduce1	vux vuy x y True	= error []
reduce2Reduce1	vux vuy x y False	= reduce2Reduce0 vux vuy x y otherwise

gcd0Gcd'2	x xz	= gcd0Gcd'1 (xz == 0) x xz
gcd0Gcd'2	yx yy	= gcd0Gcd'0 yx yy